Sciweavers

2543 search results - page 178 / 509
» Optimal Ordered Problem Solver
Sort
View
CEC
2007
IEEE
16 years 23 days ago
Convergence and rate of convergence of a foraging ant model
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
Amine M. Boumaza, Bruno Scherrer
WADS
2007
Springer
101views Algorithms» more  WADS 2007»
16 years 16 days ago
Edges and Switches, Tunnels and Bridges
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
David Eppstein, Marc J. van Kreveld, Elena Mumford...
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 6 months ago
Local search for stable marriage problems
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
15 years 11 months ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
FOCS
2010
IEEE
15 years 4 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin