17366 search results - page 201 / 3474 » New Revision Algorithms |
189
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
A new hybrid approach to optimization in dynamical environments called Collaborative Evolutionary-Swarm Optimization (CESO) is presented. CESO tracks moving optima in a dynamical ...
163
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
158
click to vote
AAECC
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
210
click to vote
BERTINORO
2005
Springer
16 years 21 days ago
2005
Springer
In this paper we present and evaluate uncoordinated on-line algorithms for simultaneous storage and replication load-balancing in DHT-based peer-to-peer systems. We compare our ap...
172
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...