Sciweavers

1159 search results - page 134 / 232
» On The Next Move in Programming
Sort
View
91
Voted
SAT
2004
Springer
95views Hardware» more  SAT 2004»
15 years 6 months ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke
90
Voted
ACG
2003
Springer
15 years 6 months ago
The 7-piece Perfect Play Lookup Database for the Game of Checkers
Many research teams and individuals have computed endgame databases for the game of chess which use the distance-to-mate metric, enabling their software to forecast the number of m...
Ed Trice, Gil Dodgen
100
Voted
ICALP
2003
Springer
15 years 6 months ago
Solving the Robots Gathering Problem
Abstract. Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct co...
Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe...
119
Voted
ICALP
2003
Springer
15 years 6 months ago
Convergence Time to Nash Equilibria
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
Eyal Even-Dar, Alexander Kesselman, Yishay Mansour
ICALP
2003
Springer
15 years 6 months ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe