Sciweavers

3838 search results - page 688 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 3 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
SIGMETRICS
2004
ACM
115views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
Emulating low-priority transport at the application layer: a background transfer service
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
Peter B. Key, Laurent Massoulié, Bing Wang
ATAL
2004
Springer
15 years 3 months ago
Decentralized Markov Decision Processes with Event-Driven Interactions
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
ECCV
2004
Springer
15 years 3 months ago
Null Space Approach of Fisher Discriminant Analysis for Face Recognition
The null space of the within-class scatter matrix is found to express most discriminative information for the small sample size problem (SSSP). The null space-based LDA takes full ...
Wei Liu, Yunhong Wang, Stan Z. Li, Tieniu Tan
GECCO
2004
Springer
102views Optimization» more  GECCO 2004»
15 years 3 months ago
Dynamic and Scalable Evolutionary Data Mining: An Approach Based on a Self-Adaptive Multiple Expression Mechanism
Data mining has recently attracted attention as a set of efficient techniques that can discover patterns from huge data. More recent advancements in collecting massive evolving da...
Olfa Nasraoui, Carlos Rojas, Cesar Cardona