Sciweavers

391 search results - page 56 / 79
» Locally Consistent Constraint Satisfaction Problems with Bin...
Sort
View
ISBI
2007
IEEE
14 years 1 months ago
Dynamic Texture Based Heart Localization and Segmentation in 4-D Cardiac Images
In this paper we present a dynamic texture based motion segmentation approach to address the challenging problem of heart localization and segmentation in 4D Spatio-temporal cardi...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas,...
WWW
2009
ACM
14 years 7 months ago
Combining global optimization with local selection for efficient QoS-aware service composition
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
Mohammad Alrifai, Thomas Risse
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
13 years 6 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
CP
2003
Springer
13 years 12 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
FLAIRS
2003
13 years 8 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings