Sciweavers

143 search results - page 10 / 29
» Timed CSP: A Retrospective
Sort
View
PADL
2010
Springer
15 years 8 months ago
Lazy Explanations for Constraint Propagators
Explanations are a technique for reasoning about constraint propagation, which have been applied in many learning, backjumping and user-interaction algorithms for constraint progra...
Ian P. Gent, Ian Miguel, Neil C. A. Moore
ICALT
2005
IEEE
15 years 5 months ago
Learning from the Pitfalls of a Case Sharing Web
Using cases for teaching and learning has received growing attention in teacher training programs. This project intends to build a web forum for student teachers to discuss their ...
Shihkuan Hsu
FOCS
1999
IEEE
15 years 4 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
FCS
2006
15 years 1 months ago
From Sequential Processes to Grid Computation
: We introduce an extended model for view-centric reasoning, EVCR, that provides more nsive and flexible abstractions for representing actual concurrency. The theory of Communicati...
Mark Burgin, Marc Smith
JACM
2010
116views more  JACM 2010»
14 years 10 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára