Sciweavers

85 search results - page 2 / 17
» Reasoning about Optimal Collections of Solutions
Sort
View
VALUETOOLS
2006
ACM
167views Hardware» more  VALUETOOLS 2006»
13 years 10 months ago
Detailed cache simulation for detecting bottleneck, miss reason and optimization potentialities
Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the...
Jie Tao, Wolfgang Karl
TARK
2009
Springer
13 years 11 months ago
Contractual traps
In numerous economic scenarios, contracting parties may not have a clear picture of all the relevant aspects. While confronted with these unawareness issues, the strategic decisio...
Ying-Ju Chen, Xiaojian Zhao
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
13 years 10 months ago
Monotonic solution concepts in coevolution
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...
Sevan G. Ficici
ATAL
2003
Springer
13 years 10 months ago
Team formation and communication restrictions in collectives
A collective of agents often needs to maximize a “world utility” function which rates the performance of an entire system, while subject to communication restrictions among th...
Adrian K. Agogino, Kagan Tumer
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 2 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak