Sciweavers

154 search results - page 9 / 31
» Approximated Consistency for Knapsack Constraints
Sort
View
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 7 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
13 years 7 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila
CPAIOR
2005
Springer
14 years 1 months ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...
COSIT
2009
Springer
125views GIS» more  COSIT 2009»
13 years 11 months ago
Merging Qualitative Constraint Networks Defined on Different Qualitative Formalisms
Abstract. This paper addresses the problem of merging qualitative constraint networks (QCNs) defined on different qualitative formalisms. Our model is restricted to formalisms wher...
Jean-François Condotta, Souhila Kaci, Pierr...