2864 search results - page 243 / 573 » Constraint Programming in OPL |
145
Voted
ICALP
2009
Springer
16 years 4 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...
138
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 ...
145
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...
130
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
133
click to vote
FMCO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we shall survey and discuss in detail the work on the relative expressiveness of recursion and replication in various process calculi. Namely, CCS, the -calculus, the...