555 search results - page 61 / 111 » Decompositions of Grammar Constraints |
98
Voted
CORR
2004
Springer
15 years 17 days ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
129
click to vote
DKE
2002
15 years 16 days ago
2002
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
109
Voted
COLING
1992
15 years 1 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...
113
click to vote
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
118
click to vote
CONSTRAINTS
2006
15 years 23 days ago
2006
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...