575 search results - page 26 / 115 » A Spectral Approach to Lower Bounds |
IPCO
2010
13 years 7 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
DATE
2005
IEEE
14 years 3 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...
INFOCOM
2003
IEEE
14 years 3 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 ...
ICOIN
2003
Springer
14 years 3 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...
HEURISTICS
2002
13 years 9 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...