Sciweavers

143 search results - page 3 / 29
» Timed CSP: A Retrospective
Sort
View
CPC
2006
110views more  CPC 2006»
15 years 4 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
ISORC
2000
IEEE
15 years 9 months ago
A Distributed Real-Time Java System Based on CSP
CSP is a fundamental concept for developing software for distributed real-time systems. The CSP paradigm constitutes a natural addition to Object Orientation and offers higherorde...
Gerald H. Hilderink, Andry W. P. Bakkers, Jan F. B...
FOCS
2002
IEEE
15 years 9 months ago
A Dichotomy Theorem for Constraints on a Three-Element Set
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
Andrei A. Bulatov
ICFEM
2009
Springer
15 years 11 months ago
Verifying Stateful Timed CSP Using Implicit Clocks and Zone Abstraction
Jun Sun 0001, Yang Liu 0003, Jin Song Dong, Xian Z...