3055 search results - page 223 / 611 » Randomized Search Trees |
113
click to vote
AAAI
1996
15 years 4 months ago
1996
This work presents a generalized theoretical framework that allows incorporation of opponent models into adversary search. We present the M algorithm, a generalization of minimax ...
129
click to vote
AAAI
1996
15 years 4 months ago
1996
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
139
click to vote
WALCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
102
click to vote
WLP
2007
Springer
15 years 9 months ago
2007
Springer
This paper presents the Kiel Curry System (KiCS) for the lazy functional logic language Curry. Its main features beyond other Curry implementations are: flexible search control by...
116
click to vote
P2P
2002
IEEE
15 years 8 months ago
2002
IEEE
We propose a new p2p network topology that reduces bandwidth consumption and provides complete searches by employing a tree hierarchy of indexing nodes that facilitates the search...