GECCO
2008
Springer
14 years 21 days ago
2008
Springer
This paper introduces two new algorithms to reduce the number of objectives in a multiobjective problem by identifying the most conflicting objectives. The proposed algorithms ar...
GECCO
2008
Springer
14 years 21 days ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
ESA
2008
Springer
14 years 21 days ago
2008
Springer
Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e. the requested service is always within strict predefined limits. V...
GG
2010
Springer
14 years 21 days ago
2010
Springer
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
FAW
2010
Springer
14 years 21 days ago
2010
Springer
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
FAW
2010
Springer
14 years 21 days ago
2010
Springer
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
ESA
2010
Springer
14 years 21 days ago
2010
Springer
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
ESA
2010
Springer
14 years 21 days ago
2010
Springer
ESA
2010
Springer
14 years 21 days ago
2010
Springer
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
ESA
2010
Springer
14 years 21 days ago
2010
Springer
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria