146 search results - page 19 / 30 » SAT-Based Complete Don't-Care Computation for Network Optimi... |
97
Voted
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
98
Voted
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
DATE
2008
IEEE
15 years 3 months ago
2008
IEEE
In many applications string pattern matching is one of the most intensive tasks in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Seque...
CP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
ICNP
1998
IEEE
15 years 1 months ago
1998
IEEE
We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting sessio...