Sciweavers

150 search results - page 3 / 30
» Hybrid Constraint Tightening for Solving Hybrid Scheduling P...
Sort
View
EVOW
2008
Springer
13 years 9 months ago
A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
Bart G. W. Craenen, Ben Paechter
CVBIA
2005
Springer
14 years 27 days ago
A Hybrid Framework for Image Segmentation Using Probabilistic Integration of Heterogeneous Constraints
In this paper we present a new framework for image segmentation using probabilistic multinets. We apply this framework to integration of regionbased and contour-based segmentation ...
Rui Huang, Vladimir Pavlovic, Dimitris N. Metaxas
ANOR
2011
214views more  ANOR 2011»
13 years 2 months ago
A hybrid constraint programming approach to the log-truck scheduling problem
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...
ECAI
2004
Springer
14 years 22 days ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...
CP
2004
Springer
14 years 23 days ago
Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
Andrew Sadler, Carmen Gervet