3415 search results - page 207 / 683 » Lower bounds on kernelization |
155
click to vote
QEST
2006
IEEE
16 years 7 days ago
2006
IEEE
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
153
click to vote
DATE
2005
IEEE
15 years 12 months ago
2005
IEEE
- The problem of determining lower bounds for the energy cost of a given nanoscale design is addressed via a complexity theory-based approach. This paper provides a theoretical fra...
148
click to vote
EUROPAR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
154
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— Designing optimal measurement infrastructure is a key step for network management. In this work we address the problem of optimizing a scalable distributed polling system. The ...
231
click to vote
ICOIN
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...