Sciweavers

699 search results - page 123 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
IOR
2007
89views more  IOR 2007»
14 years 9 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
TEC
2008
127views more  TEC 2008»
14 years 9 months ago
Fingerprinting: Visualization and Automatic Analysis of Prisoner's Dilemma Strategies
Fingerprinting is a technique for generating a representation-independent functional signature for a game playing agent. Fingerprints can be used to compare agents across represent...
Daniel A. Ashlock, Eun-Youn Kim
GECCO
2008
Springer
132views Optimization» more  GECCO 2008»
14 years 10 months ago
Hybridizing an evolutionary algorithm with mathematical programming techniques for multi-objective optimization
In recent years, the development of multi-objective evolutionary algorithms (MOEAs) hybridized with mathematical programming techniques has significantly increased. However, most...
Saúl Zapotecas Martínez, Carlos A. C...
SIGMETRICS
2011
ACM
237views Hardware» more  SIGMETRICS 2011»
14 years 15 days ago
Analysis of DCTCP: stability, convergence, and fairness
Cloud computing, social networking and information networks (for search, news feeds, etc) are driving interest in the deployment of large data centers. TCP is the dominant Layer 3...
Mohammad Alizadeh, Adel Javanmard, Balaji Prabhaka...
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
15 years 10 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb