833 search results - page 31 / 167 » Simpler and better approximation algorithms for network desi... |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
DSP applications can be suitably represented using Process Network Models. This paper uses a modification of Kahn Process Network to solve the problem of finding an optimum arch...
PPSN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
INFORMS
1998
13 years 7 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...