2095 search results - page 201 / 419 » Improved pebbling bounds |
195
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
165
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
164
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
159
click to vote
PERCOM
2008
ACM
16 years 6 months ago
2008
ACM
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
165
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— It was shown by Cadambe and Jafar that the interference alignment (IA) algorithm achieves the theoretical bound on degrees of freedom (DOF) for interference channel systems. Ho...