5130 search results - page 897 / 1026 » Constraint Query Languages |
120
click to vote
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
174
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
139
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
126
click to vote
TAPSOFT
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
163
click to vote
FIW
1998
15 years 4 months ago
1998
We present a method to systematically detect feature interactions in requirements, which are expressed as constraints on system event traces. We show its application on the lift sy...