2398 search results - page 11 / 480 » Constraint Programming and Graph Algorithms |
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
ESOP
2009
Springer
14 years 9 days ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
ECOOP
1993
Springer
14 years 15 days ago
1993
Springer
Abstract. We have designed and implemented a type inference algorithm for the Self language. The algorithm can guarantee the safety and disambiguity of message sends, and provide u...
WEA
2010
Springer
14 years 3 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...