2681 search results - page 221 / 537 » Problem F |
122
Voted
FOCS
1998
IEEE
15 years 5 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...
96
Voted
TOPLAS
2008
15 years 20 days ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
106
Voted
SIGECOM
2009
ACM
15 years 7 months ago
2009
ACM
We study auctions for selling a limited supply of a single commodity in the case where the supply is known in advance and the case it is unknown and must be instead allocated in a...
98
Voted
EUSFLAT
2001
15 years 2 months ago
2001
Intelligent autonomous robots and multiagent systems, having different skills and capabilities for specific subtasks, have the potential to solve problems more efficiently and eff...
118
Voted
TCS
2010
14 years 7 months ago
2010
The incremental approach to modular monadic semantics constructs complex monads by using monad transformers to add computational features to a preexisting monad. A complication of...