706 search results - page 10 / 142 » Super Solutions in Constraint Programming |
CP
2004
Springer
15 years 5 months ago
2004
Springer
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
136
click to vote
AMAI
1999
Springer
14 years 11 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
CP
2005
Springer
15 years 5 months ago
2005
Springer
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
ISMB
1994
15 years 29 days ago
1994
Restrictionmappinggenerallyrequires the applicationof information from various digestions by restriction enzymesto find solution sets. Weuse boththe predicate calculusandconstrain...
CP
2003
Springer
15 years 4 months ago
2003
Springer
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...