945 search results - page 74 / 189 » Incremental Branching Programs |
115
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
100
click to vote
EUROPAR
2000
Springer
15 years 5 months ago
2000
Springer
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...
112
click to vote
AAAI
2008
15 years 3 months ago
2008
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (gene...
129
click to vote
NETWORKS
2008
15 years 1 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
141
click to vote
ESOP
2006
Springer
15 years 5 months ago
2006
Springer
This paper describes FrTime, an extension of Scheme designed for writing interactive applications. Inspired by functional reactive programming, the language embeds dynamic dataflow...