Sciweavers

17366 search results - page 201 / 3474
» New Revision Algorithms
Sort
View
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
15 years 10 months ago
A new collaborative evolutionary-swarm optimization technique
A new hybrid approach to optimization in dynamical environments called Collaborative Evolutionary-Swarm Optimization (CESO) is presented. CESO tracks moving optima in a dynamical ...
Rodica Ioana Lung, D. Dumitrescu
ISSAC
2007
Springer
112views Mathematics» more  ISSAC 2007»
15 years 10 months ago
G-graphs for the cage problem: a new upper bound
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...
Alain Bretto, Luc Gillibert
AAECC
2006
Springer
79views Algorithms» more  AAECC 2006»
15 years 10 months ago
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems
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 ...
Moshe Schwartz, Alexander Vardy
BERTINORO
2005
Springer
15 years 10 months ago
Multifaceted Simultaneous Load Balancing in DHT-Based P2P Systems: A New Game with Old Balls and Bins
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...
Karl Aberer, Anwitaman Datta, Manfred Hauswirth
WDAG
2001
Springer
104views Algorithms» more  WDAG 2001»
15 years 9 months ago
A New Synchronous Lower Bound for Set Agreement
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...
Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle