Sciweavers

344 search results - page 44 / 69
» The Santa Claus problem
Sort
View
JSAT
2006
108views more  JSAT 2006»
13 years 9 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
JAR
2007
132views more  JAR 2007»
13 years 9 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz
JSAT
2007
63views more  JSAT 2007»
13 years 9 months ago
The Complexity of Some Subclasses of Minimal Unsatis able Formulas
This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...
Hans Kleine Büning, Xishun Zhao
CPHYSICS
2011
267views Education» more  CPHYSICS 2011»
13 years 1 months ago
Fast alignment of a complex tracking detector using advanced track models
The inner silicon detector of the Compact Muon Solenoid experiment (CMS) at CERN’s LHC consists of 16 588 modules. Charged-particle tracks in the detector are used to improve th...
Volker Blobel, Claus Kleinwort, Frank Meier
ECCV
2004
Springer
14 years 11 months ago
Reliable Fiducial Detection in Natural Scenes
Reliable detection of fiducial targets in real-world images is addressed in this paper. We show that even the best existing schemes are fragile when exposed to other than laborator...
David Claus, Andrew W. Fitzgibbon