Sciweavers

9119 search results - page 167 / 1824
» A Simultaneous Search Problem
Sort
View
CP
2008
Springer
15 years 2 months ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus
FGCS
2000
81views more  FGCS 2000»
15 years 29 days ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
SOFSEM
2004
Springer
15 years 6 months ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...
AAAI
2008
15 years 3 months ago
Hybrid Constraint Tightening for Solving Hybrid Scheduling Problems
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
James C. Boerkoel Jr., Edmund H. Durfee
FEGC
2006
92views Biometrics» more  FEGC 2006»
15 years 2 months ago
Maintaining an Online Bibliographical Database: The Problem of Data Quality
CiteSeer and Google-Scholar are huge digital libraries which provide access to (computer-)science publications. Both collections are operated like specialized search engines, they ...
Michael Ley, Patrick Reuther