Programs and Algorithms
Probabilistic Graph Programs for Randomised and Evolutionary Algorithms
... In this section we address three other approaches to graph transformation which incorporate probabilities. All three aim at modelling and analysing systems rather than implementing algorithms by graph ...
16
Optimization Algorithms in School Scheduling Programs: Study, Analysis and Results
... After analyzing commercial programs we recognized that each of them has some advan- tages and some disadvantages. However, in our opinion, none of them can be applicable in school. A user needs to set the final ...
16
Genetic algorithms, minmax problems, distributed optimization programs, nested decompostion
... optimization programs) are introduced as syntactical entities containing certain optimization elements and based on composition ...of programs’ structures, semantics for certain DOPs can also be ...genetic ...
5
Decomposition Algorithms and Parallel Computing for Chance-constrained and Stochastic Integer Programs with Applications.
... 0-1 programs, where decisions made before the realization of uncertainty are ...proposed algorithms and schemes, the results also indicate the time-expense of the subgradient method and the inefficiency of ...
118
A new exchange method with a refined subproblem for solving convex semi-infinite programs (Optimization Algorithms : theory, application and implementation)
... The semi-infinite programming problem (SIP) is an optimization problem with an infinite num- ber of constraints in a finite dimensional space. The SIP has been studied extensively so far, since a lot of practical ...
14
Exact algorithms for semidefinite programs with degenerate feasible set
... Numerical software for solving SDP are mostly based on the interior point method, assuming some non-degeneracy properties such as the existence of interior points in the admissible set. In this paper, we design an exact ...
18
Models and algorithms for dominance-constrained stochastic programs with recourse
... There are (at least) three options for solving the dominance-constrained stochas- tic programs studied in the present thesis. The first is to apply a general- purpose mixed-integer linear programming solver such ...
125
Use of genetic algorithms in graphic programs to optimise autonomus behavior
... Abstract In the production of animated films, problems frequently arise in scenes with groups of moving objects. Animating each object or member of the group in- dividually can be very time consuming, which is why ...
49
Designing the Methods and Algorithms of the Estimation Malicious Programs on the Base of Fuzzy Mathematical Models
... The value of the total square-law error characterizes the fitness of detector to finding malicious files. The less importance of detector is more fitness. So value of the total square-law error is possible to use for ...
8
A Survey on Demand Response Programs in Smart Grids: Pricing Methods and Optimization Algorithms
... Based on the above survey, we can focus on the challenges, advantages and also limitations that arise from the implemen- tation of these DR methods, which should be addressed in order to make more efficient and cost ...
23
Fast Algorithms for Monotonic Discounted Linear Programs with Two Variables per Inequality
... polynomial algorithms for finding unique optimal solutions to system of linear 2-variable monotonic inequalities, running in time O(mn 2 ) and O(mn 2 log m) for equal and different discounting factors, ...
14
Algorithms and Tools for Verification and Testing of Asynchronous Programs
... multi-threaded programs [65, ...the algorithms from [35, 119] are unlikely to perform well: Karp- Miller trees for VAS do not perform well in practice, and Demri et ...
157
Optimized algorithms for the incremental analysis of logic programs
... Unfortunately, traditional fixpoint algorithms for abstract interpretation of logic programs cannot be used directly (at least in general) in the context of incremental analysis for re[r] ...
15
Algorithms for Stochastic Integer Programs Using Fenchel Cutting Planes
... completely close the gap between the lower and upper bounds for ST-FD. This was also done in [76] under the D 2 algorithms. Finally, the last column is the CPLEX MIP gap after directly solving the DEP for one ...
130
Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?
... Carlo algorithms are studied for designing discrete approx- imations of two-stage linear stochastic ...Carlo algorithms may achieve the optimal rate of convergence O ( n − 1+ δ ) with δ ∈ (0 , 1 2 ] and a ...
33
Algorithms and literate programs for weighted low-rank approximation with missing data
... by Srebro [18] for arbitrary weights. In this paper, apart from the alternating projections algorithm, we con- sider an algorithm for weighted low-rank approximation with missing data, based on the variable projections ...
9
Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs
... 21 R. Jain and P. Yao. A parallel approximation algorithm for mixed packing and covering semidefinite programs. CoRR, abs/1201.6090, 2012. arXiv:1201.6090. 22 P. Klein and H.-I Lu. Efficient Approximation ...
15
Advances in Methods, Algorithms and Software for Optimization and Simulation of Kidney Paired Donation Programs
... KPD programs are performed, demonstrating a substantial advantage in selecting such subgraphs, in terms of realized utility, compared to the standard KPD ...
104
Clever Algorithms
... 3.7.3 Metaphor The phenotype is a computer program that is created from a binary string- based genome. The genome is decoded into a sequence of integers that are in turn mapped onto pre-defined rules that makeup the ...
437
Evolutionary Algorithms for
... Fig. 34: SDF compilation model from (Bhattacharyya, Murthy, and Lee 1996, p.17). order in which the actors are executed but is also influenced by the underly- ing code generation model. Schedules can be implemented in ...
134