837 search results - page 116 / 168 » Distributed algorithms for reaching consensus on general fun... |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Typical applications of evolutionary optimization in static environments involve the approximation of the extrema of functions. For dynamic environments, the interest is not to lo...
SPAA
2003
ACM
14 years 2 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
MOR
2006
13 years 9 months ago
2006
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
ATAL
2003
Springer
14 years 2 months ago
2003
Springer
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...