32032 search results - page 6104 / 6407 » Verified programming in Guru |
182
click to vote
CIKM
2005
Springer
16 years 9 days ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
168
click to vote
CP
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
193
click to vote
CP
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
169
click to vote
CP
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
235
click to vote
DIGRA
2005
Springer
16 years 9 days ago
2005
Springer
Building on the work of games theorists and virtual world designers, this paper proposes a framework for understanding the real-virtual dichotomy in terms of a series of five fram...