Sciweavers

2412 search results - page 59 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
CP
2006
Springer
13 years 12 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 9 months ago
Efficient Algorithms for Processing XPath Queries
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
Georg Gottlob, Christoph Koch, Reinhard Pichler
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 9 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
AI
2008
Springer
13 years 10 months ago
Domain filtering consistencies for non-binary constraints
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
Christian Bessiere, Kostas Stergiou, Toby Walsh
TSP
2010
13 years 4 months ago
Single antenna power measurements based direction finding
Abstract--In this paper, the problem of estimating direction-ofarrival (DOA) of multiple uncorrelated sources from single antenna power measurements is addressed. Utilizing the fac...
Joni Polili Lie, Thierry Blu, Chong Meng Samson Se...