914 search results - page 42 / 183 » Branch and Bound on the Network Model |
102
click to vote
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
ISCA
1999
IEEE
15 years 1 months ago
1999
IEEE
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve the promised performance increases of superscalar and VLIW processors. One of the...
DCOSS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
LCN
2008
IEEE
15 years 4 months ago
2008
IEEE
—Network calculus is a recently developed theory dealing with queuing systems found in computer networks with focus on service guarantee analysis. In the current network calculus...
MASCOTS
2007
14 years 11 months ago
2007
— The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be explo...