60 search results - page 5 / 12 » On Binary Searching with Nonuniform Costs |
AAAI
1996
13 years 9 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
CG
2000
Springer
14 years 12 hour ago
2000
Springer
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
TVCG
2008
13 years 7 months ago
2008
Abstract-Wikipedia is an example of the collaborative, semi-structured data sets emerging on the Web. These data sets have large, nonuniform schema that require costly data integra...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
IPL
2010
13 years 6 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...