986 search results - page 165 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
143
Voted
CN
2011
14 years 10 months ago
2011
—In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the ...
97
Voted
COLT
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
117
Voted
ICCAD
1994
IEEE
15 years 7 months ago
1994
IEEE
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...
126
Voted
ALENEX
2010
15 years 5 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
134
Voted
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...