Sciweavers

805 search results - page 39 / 161
» Enumerating All Solutions for Constraint Satisfaction Proble...
Sort
View
CP
2008
Springer
13 years 10 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
CSCLP
2006
Springer
14 years 5 days ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
EVOW
2001
Springer
14 years 1 months ago
Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...
Marc Bufé, Tim Fischer, Holger Gubbels, Cla...
ENTCS
2008
64views more  ENTCS 2008»
13 years 8 months ago
Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
In this note we consider the computability of the solution of the initial-value problem for ordinary differential equations with continuous right-hand side. We present algorithms ...
Pieter Collins, Daniel S. Graça
PPSN
1998
Springer
14 years 21 days ago
Methods to Evolve Legal Phenotypes
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
Tina Yu, Peter J. Bentley