6456 search results - page 220 / 1292 » Constraint Solving on Terms |
169
click to vote
PAMI
2006
15 years 6 months ago
2006
We contrast the performance of two methods of imposing constraints during the tracking of articulated objects, the first method preimposing the kinematic constraints during trackin...
155
click to vote
IJON
2008
15 years 6 months ago
2008
Nonnegative Matrix Factorization (NMF) solves the following problem: find such nonnegative matrices A RI
157
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
184
click to vote
ATAL
2007
Springer
16 years 21 days ago
2007
Springer
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
173
click to vote
CP
1999
Springer
15 years 10 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...