743 search results - page 8 / 149 » Constraint Programming Architectures: Review and a New Propo... |
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
PPDP
2004
Springer
15 years 5 months ago
2004
Springer
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
106
click to vote
CP
2003
Springer
15 years 4 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
IROS
2008
IEEE
15 years 6 months ago
2008
IEEE
— We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for ge...
DAC
1997
ACM
15 years 3 months ago
1997
ACM
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...