143 search results - page 14 / 29 » Timed CSP: A Retrospective |
167
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
145
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
169
click to vote
TSE
2008
15 years 5 months ago
2008
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variabl...
142
click to vote
ICSE
2001
IEEE-ACM
15 years 10 months ago
2001
IEEE-ACM
The design of complex systems requires powerful mechanisms for modeling state, concurrent events, and real-time behavior; as well as for visualising and structuring systems in ord...
154
click to vote
LICS
2009
IEEE
16 years 12 days ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...