Sciweavers

562 search results - page 29 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
ISIPTA
2003
IEEE
140views Mathematics» more  ISIPTA 2003»
15 years 2 months ago
A Second-Order Uncertainty Model of Independent Random Variables: An Example of the Stress-Strength Reliability
A second-order hierarchical uncertainty model of a system of independent random variables is studied in the paper. It is shown that the complex nonlinear optimization problem for ...
Lev V. Utkin
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
14 years 7 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
ECCC
2000
140views more  ECCC 2000»
14 years 9 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
FOCS
2007
IEEE
15 years 4 months ago
Reconstruction for Models on Random Graphs
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
Antoine Gerschenfeld, Andrea Montanari
79
Voted
FOCI
2007
IEEE
15 years 4 months ago
Faster Evolutionary Algorithms by Superior Graph Representation
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
Benjamin Doerr, Christian Klein, Tobias Storch