242 search results - page 16 / 49 » Object-level Vertical Search |
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
ICWE
2009
Springer
14 years 6 days ago
2009
Springer
With the advent of the Web, search has become the prominent paradigm for information seeking, not only across the online space but also within enterprises. Search engine functiona...
AAAI
2010
13 years 9 months ago
2010
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
AI
2002
Springer
13 years 7 months ago
2002
Springer
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
DAM
2000
13 years 7 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...