Sciweavers

101 search results - page 18 / 21
» A Case for Simple SAT Solvers
Sort
View
AI
2010
Springer
13 years 7 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...
ICCV
1999
IEEE
14 years 9 months ago
Camera Pose and Calibration from 4 or 5 Known 3D Points
We describe two direct quasilinear methods for camera pose (absolute orientation) and calibration from a single image of 4 or 5 known 3D points. They generalize the 6 point `Direc...
Bill Triggs
IJCAI
2001
13 years 8 months ago
Dynamic Control Of Plans With Temporal Uncertainty
Certain planning systems that deal with quantitative time constraints have used an underlying Simple Temporal Problem solver to ensure temporal consistency of plans. However, many...
Paul H. Morris, Nicola Muscettola, Thierry Vidal
CF
2010
ACM
14 years 15 days ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross
LPAR
2005
Springer
14 years 27 days ago
Disjunctive Constraint Lambda Calculi
Abstract. Earlier we introduced Constraint Lambda Calculi which integrate constraint solving with functional programming for the simple case where the constraint solver produces no...
Matthias M. Hölzl, John N. Crossley