Sciweavers

1404 search results - page 103 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ICAC
2006
IEEE
15 years 4 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
GECCO
2004
Springer
147views Optimization» more  GECCO 2004»
15 years 3 months ago
A Demonstration of Neural Programming Applied to Non-Markovian Problems
Genetic programming may be seen as a recent incarnation of a long-held goal in evolutionary computation: to develop actual computational devices through evolutionary search. Geneti...
Gabriel Catalin Balan, Sean Luke
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
15 years 4 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
ICCSA
2004
Springer
15 years 3 months ago
Network Probabilistic Connectivity: Optimal Structures
Abstract. The problems of optimizing the network structure by the reliability criteria is discussed. The networks with absolutely reliable nodes and unreliable edges are considered...
Olga K. Rodionova, Alexey S. Rodionov, Hyunseung C...
ESA
2010
Springer
170views Algorithms» more  ESA 2010»
14 years 11 months ago
Streaming Graph Computations with a Helpful Advisor
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
Graham Cormode, Michael Mitzenmacher, Justin Thale...