Sciweavers

30 search results - page 3 / 6
» The Complexity of Membership Problems for Circuits Over Sets...
Sort
View
CIE
2007
Springer
13 years 11 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
AI
2006
Springer
13 years 5 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne
PVLDB
2008
104views more  PVLDB 2008»
13 years 4 months ago
Scalable multi-query optimization for exploratory queries over federated scientific databases
The diversity and large volumes of data processed in the Natural Sciences today has led to a proliferation of highlyspecialized and autonomous scientific databases with inherent a...
Anastasios Kementsietsidis, Frank Neven, Dieter Va...
COMPGEOM
2007
ACM
13 years 9 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
13 years 10 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm