Sciweavers

14548 search results - page 2452 / 2910
» The Optimal Path-Matching Problem
Sort
View
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
15 years 10 months ago
Growth of self-canceling code in evolutionary systems
This research examines the behavior of inoperative code (introns) in the evolution of genetically robust solutions. Genetically robust solutions are solutions that are less likely...
Xue Zhong, Terence Soule
FOCS
2000
IEEE
15 years 10 months ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos
ATAL
2008
Springer
15 years 9 months ago
Distributed multiagent resource allocation in diminishing marginal return domains
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...
Yoram Bachrach, Jeffrey S. Rosenschein
CGO
2008
IEEE
15 years 9 months ago
Comprehensive path-sensitive data-flow analysis
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
Aditya V. Thakur, R. Govindarajan
ATMOS
2008
101views Optimization» more  ATMOS 2008»
15 years 8 months ago
Robust Line Planning under Unknown Incentives and Elasticity of Frequencies
The problem of robust line planning requests for a set of origin-destination paths (lines) along with their traffic rates (frequencies) in an underlying railway network infrastruct...
Spyros C. Kontogiannis, Christos D. Zaroliagis
« Prev « First page 2452 / 2910 Last » Next »