Sciweavers

35 search results - page 2 / 7
» A Fast and Simple Algorithm for Bounds Consistency of the Al...
Sort
View
CP
2008
Springer
13 years 6 months ago
Optimization of Simple Tabular Reduction for Table Constraints
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
Christophe Lecoutre
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 7 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ICASSP
2010
IEEE
13 years 5 months ago
Total-variation regularization with bound constraints
We present a new algorithm for bound-constrained totalvariation (TV) regularization that in comparison with its predecessors is simple, fast, and flexible. We use a splitting app...
Rick Chartrand, Brendt Wohlberg
ATAL
2010
Springer
13 years 6 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
AI
2008
Springer
13 years 5 months ago
Theoretical analysis of singleton arc consistency and its extensions
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
Christian Bessiere, Romuald Debruyne