391 search results - page 59 / 79 » Locally Consistent Constraint Satisfaction Problems with Bin... |
COLING
1992
13 years 8 months ago
1992
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
TIME
1994
IEEE
13 years 11 months ago
1994
IEEE
We are concerned with temporalreasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence co...
COCOA
2007
Springer
14 years 27 days ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
KR
2004
Springer
14 years 3 days ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
CP
2001
Springer
13 years 11 months ago
2001
Springer
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...