Sciweavers

675 search results - page 116 / 135
» Biased Range Trees
Sort
View
IJCAI
2003
15 years 7 days ago
Employing Trainable String Similarity Metrics for Information Integration
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
Mikhail Bilenko, Raymond J. Mooney
IJCAI
1989
15 years 1 days ago
The Reason for the Benefits of Minimax Search
based on an abstract concept of quiescence. In the following we sketch this and a related model, describe the design of our experiments, and present the results of our simulation s...
Anton Scheucher, Hermann Kaindl
79
Voted
AI
2008
Springer
14 years 11 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson
CORR
2010
Springer
117views Education» more  CORR 2010»
14 years 11 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou
CONSTRAINTS
2006
70views more  CONSTRAINTS 2006»
14 years 11 months ago
Stochastic Constraint Programming: A Scenario-Based Approach
To model combinatorial decision problems involving uncertainty and probability, we introduce scenario based stochastic constraint programming. Stochastic constraint programs conta...
Armagan Tarim, Suresh Manandhar, Toby Walsh