1402 search results - page 93 / 281 » Sparse-Memory Graph Search |
119
Voted
AAAI
1996
15 years 3 months ago
1996
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
116
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
133
click to vote
CONSTRAINTS
2007
15 years 2 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
132
click to vote
CP
2003
Springer
15 years 7 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
97
Voted
ENTER
2009
Springer
15 years 7 months ago
2009
Springer
Hyperlinks are the essence of the World Wide Web. Their importance is very high due to their ability to provide a visitor with a wealth of good quality information and for the rol...