1051 search results - page 152 / 211 » Foundations of Constraint Satisfaction |
ACTA
2002
13 years 9 months ago
2002
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
CP
2008
Springer
13 years 11 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
COMPGEOM
1992
ACM
14 years 2 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
PODC
2012
ACM
12 years 11 days ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
CADE
2002
Springer
14 years 10 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...