18306 search results - page 2910 / 3662 » Algorithmics in Exponential Time |
240
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
246
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...
197
click to vote
SPAA
1997
ACM
15 years 11 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
205
click to vote
SIGMETRICS
2010
ACM
15 years 11 months ago
2010
ACM
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
251
click to vote
DASFAA
2010
IEEE
15 years 11 months ago
2010
IEEE
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...