1381 search results - page 97 / 277 » Computational Complexity of Constraint Satisfaction |
239
click to vote
CP
2009
Springer
16 years 4 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
128
Voted
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
118
click to vote
FGR
2008
IEEE
15 years 10 months ago
2008
IEEE
Despite significant progress in deformable model fitting over the last decade, the problem of efficient and accurate person-independentface fitting remains a challenging probl...
119
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
160
click to vote
BROADNETS
2006
IEEE
15 years 10 months ago
2006
IEEE
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...