217 search results - page 42 / 44 » Backdoors To Typical Case Complexity |
143
Voted
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
164
Voted
HOTOS
2003
IEEE
15 years 9 months ago
2003
IEEE
—Traditional hierarchical namespaces are not sufficient for representing and managing the rich semantics of today’s storage systems. In this paper, we discuss the principles o...
148
Voted
MOBICOM
2003
ACM
15 years 9 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
130
click to vote
CLIMA
2007
15 years 5 months ago
2007
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...
145
Voted
DLOG
2006
15 years 5 months ago
2006
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...