7092 search results - page 557 / 1419 » Parallelizing constraint programs |
145
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
140
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
147
click to vote
FLAIRS
2008
15 years 5 months ago
2008
This paper describes an algorithm developed as a decision support system for SMT line operators and its purpose is to suggest changes in an existing feeder setup in order to impro...
111
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
137
click to vote
CONCUR
2009
Springer
15 years 11 months ago
2009
Springer
Several programming constructs have recently been proposed with the purpose of enabling the programmer to encode declassifying information flows within a program that complies wi...