Sciweavers

2343 search results - page 54 / 469
» Visual-Concept Search Solved
Sort
View
CPAIOR
2007
Springer
15 years 10 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter
TIME
2002
IEEE
15 years 9 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
ICGA
2007
90views Optimization» more  ICGA 2007»
15 years 4 months ago
Game Over: Black to Play and Draw in Checkers
In 1989, an effort to solve the game of checkers began. It was naïve because of the daunting size of the search space, 5×1020 positions, and because of computer capabilities of ...
Jonathan Schaeffer
123
Voted
AI
2003
Springer
15 years 9 months ago
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
Dave A. D. Tompkins, Holger H. Hoos
AAECC
2006
Springer
132views Algorithms» more  AAECC 2006»
15 years 4 months ago
The Conjugacy Search Problem in Public Key Cryptography: Unnecessary and Insufficient
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. This problem is in the core of several recently suggested public key ...
Vladimir Shpilrain, Alexander Ushakov