Sciweavers

717 search results - page 57 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
132 views 98 votes 15 years 2 months ago  FLAIRS 2006»
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
145 views 96 votes 15 years 3 months ago  AUSAI 2005»
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...
141 views 122 votes 15 years 3 months ago  CP 2008»
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...
119 views 110 votes 15 years 1 months ago  EOR 2010»
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
242 views 123 votes 14 years 5 months ago  WIOPT 2011»
—In this paper, we address the spectrum portfolio optimization (SPO) question in the context of secondary spectrum markets, where bandwidth (spectrum access rights) can be bought...
138 views 131 votes 15 years 8 months ago  MATES 2009»
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
206 views 219 votes 16 years 2 months ago  CP 2009»
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
120 views 84 votes 15 years 7 months ago  HM 2007»
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
189 views 110 votes 16 years 3 months ago  CVPR 2008»
This paper proposes a technique for estimating piecewise planar models of objects from their images and geometric constraints. First, assuming a bounded noise in the localization ...
106 views 107 votes 15 years 3 months ago  FLAIRS 2008»
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...