268 search results - page 53 / 54 » Linear Context Free Languages |
CP
2005
Springer
13 years 11 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...
APLAS
2005
ACM
13 years 11 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
COLING
1992
13 years 7 months ago
1992
Q Should I take AI this semester? We address the problem of generating a coherent A If you want to take courses likeparagraph presenting arguments for a conclusion in a Natural La...