Sciweavers

1453 search results - page 264 / 291
» Partial Constraint Satisfaction
Sort
View
ECAI
2008
Springer
14 years 11 months ago
A new Approach for Solving Satisfiability Problems with Qualitative Preferences
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
IJCAI
2007
14 years 11 months ago
Communicating Effectively in Resource-Constrained Multi-Agent Systems
Agents with partial observability need to share information to achieve decentralised coordination. However, in resource-constrained systems, indiscriminate communication can creat...
Partha Sarathi Dutta, Claudia V. Goldman, Nicholas...
OPODIS
2008
14 years 11 months ago
Graph Augmentation via Metric Embedding
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
Emmanuelle Lebhar, Nicolas Schabanel
SDM
2007
SIAM
176views Data Mining» more  SDM 2007»
14 years 11 months ago
Adaptive Concept Learning through Clustering and Aggregation of Relational Data
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
Hichem Frigui, Cheul Hwang
87
Voted
NIPS
2004
14 years 11 months ago
The Correlated Correspondence Algorithm for Unsupervised Registration of Nonrigid Surfaces
We present an unsupervised algorithm for registering 3D surface scans of an object undergoing significant deformations. Our algorithm does not need markers, nor does it assume pri...
Dragomir Anguelov, Praveen Srinivasan, Hoi-Cheung ...