Sciweavers

97 search results - page 4 / 20
» Using Generalized Constraints and Protoforms to Deal with Ad...
Sort
View
AUSAI
2003
Springer
14 years 19 days ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar
CP
2003
Springer
14 years 18 days ago
An Algebraic Approach to Multi-sorted Constraints
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
Andrei A. Bulatov, Peter Jeavons
DAGM
2009
Springer
14 years 1 months ago
Optimal Parameter Estimation with Homogeneous Entities and Arbitrary Constraints
Abstract. Well known estimation techniques in computational geometry usually deal only with single geometric entities as unknown parameters and do not account for constrained obser...
Jochen Meidow, Wolfgang Förstner, Christian B...
ISVC
2010
Springer
13 years 5 months ago
Introducing Fuzzy Spatial Constraints in a Ranked Partitioned Sampling for Multi-object Tracking
Dealing with multi-object tracking in a particle filter raises several issues. A first essential point is to model possible interactions between objects. In this article, we repr...
Nicolas Widynski, Séverine Dubuisson, Isabe...
ATAL
2006
Springer
13 years 11 months ago
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
Katsutoshi Hirayama