Sciweavers

2343 search results - page 4 / 469
» Visual-Concept Search Solved
Sort
View
FLAIRS
2007
14 years 1 months ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
AAAI
2000
14 years 7 days ago
Combining Knowledge and Search to Solve Single-Suit Bridge
In problem solving, it is often important not only to find a solution but also to be able to explain it. We use the game of Bridge to illustrate how tactics, which formalise domai...
Ian Frank, David A. Basin, Alan Bundy
JAR
2000
149views more  JAR 2000»
13 years 10 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang
EVOW
2008
Springer
14 years 19 days ago
A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
Bart G. W. Craenen, Ben Paechter
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 5 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...