Sciweavers

11328 search results - page 32 / 2266
» Timed Branching Processes
Sort
View
GRID
2006
Springer
15 years 1 months ago
YA: Fast and Scalable Discovery of Idle CPUs in a P2P network
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
Javier Celaya, Unai Arronategui
HPCA
2008
IEEE
16 years 2 months ago
Address-branch correlation: A novel locality for long-latency hard-to-predict branches
Hard-to-predict branches depending on longlatency cache-misses have been recognized as a major performance obstacle for modern microprocessors. With the widening speed gap between...
Hongliang Gao, Yi Ma, Martin Dimitrov, Huiyang Zho...
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
15 years 8 months ago
Finding Branch-Decompositions and Rank-Decompositions
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Petr Hlinený, Sang-il Oum
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
15 years 8 months ago
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
Artur Alves Pessoa, Marcus Poggi de Aragão,...
MP
2006
75views more  MP 2006»
15 years 1 months ago
A Class of stochastic programs with decision dependent uncertainty
We address a class of problems where decisions have to be optimized over a time horizon given that the future is uncertain and that the optimization decisions influence the time o...
Vikas Goel, Ignacio E. Grossmann