197 search results - page 11 / 40 » Advances in Local Search for Satisfiability |
93
Voted
DAM
2008
15 years 15 days ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
83
Voted
AICOM
2007
15 years 17 days ago
2007
Abstract. Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial natur...
91
Voted
CHI
2004
ACM
16 years 23 days ago
2004
ACM
This paper presents a modified diary study that investigated how people performed personally motivated searches in their email, in their files, and on the Web. Although earlier st...
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...