2636 search results - page 168 / 528 » Linear Programming |
199
Voted
CP
2009
Springer
16 years 3 months ago
2009
Springer
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disen...
111
click to vote
CONCUR
2007
Springer
15 years 8 months ago
2007
Springer
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of sync...
115
click to vote
ICALP
2010
Springer
15 years 10 days ago
2010
Springer
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of intervals (HS) that features four modal operators corresponding to the relations &...
112
click to vote
CP
2004
Springer
15 years 7 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
102
click to vote
ICALP
2009
Springer
15 years 6 months ago
2009
Springer
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...