Sciweavers

364 search results - page 42 / 73
» Generalized normal forms and polynomial system solving
Sort
View
ATAL
2006
Springer
15 years 1 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
CORR
2010
Springer
173views Education» more  CORR 2010»
14 years 9 months ago
Local search for stable marriage problems
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 3 days ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
DRR
2009
14 years 7 months ago
Retrieval of historical documents by word spotting
The implementation of word spotting is not an easy procedure and it gets even worse in the case of historical documents since it requires character recognition and indexing of the...
Nikoleta Doulgeri, Ergina Kavallieratou
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
15 years 11 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold