1429 search results - page 133 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
WMCSA
2002
IEEE
14 years 2 months ago
2002
IEEE
Applications running on a mobile and wireless devices must be able to adapt gracefully to limited and fluctuating network resources. The variety of applications, platforms upon w...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even r...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
SPIRE
2010
Springer
13 years 7 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...