Sciweavers

614 search results - page 33 / 123
» Probabilistic Arc Consistency
Sort
View
ECAI
2008
Springer
13 years 11 months ago
Hybrid tractable CSPs which generalize tree structure
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
Martin C. Cooper, Peter G. Jeavons, András ...
IJCAI
2001
13 years 11 months ago
Refining the Basic Constraint Propagation Algorithm
Constraint propagation is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the us...
Christian Bessière, Jean-Charles Rég...
APIN
2010
108views more  APIN 2010»
13 years 10 months ago
A low variance error boosting algorithm
Abstract. This paper introduces a robust variant of AdaBoost, cwAdaBoost, that uses weight perturbation to reduce variance error, and is particularly effective when dealing with da...
Ching-Wei Wang, Andrew Hunter
FUIN
2008
124views more  FUIN 2008»
13 years 10 months ago
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
In this paper, we show how to obtain causal semantics distinguishing "earlier than" and "not later than" causality between events from algebraic semantics of Pe...
Gabriel Juhás, Robert Lorenz, Sebastian Mau...
HEURISTICS
2002
155views more  HEURISTICS 2002»
13 years 9 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz