Sciweavers

451 search results - page 46 / 91
» Approximation algorithms for stochastic orienteering
Sort
View
PVM
2004
Springer
14 years 2 months ago
A Refinement Strategy for a User-Oriented Performance Analysis
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
Jan Lemeire, Andy Crijns, John Crijns, Erik F. Dir...
WSC
2004
13 years 10 months ago
Exploiting Temporal Uncertainty in Process-Oriented Distributed Simulations
Existing research has defined a new type of simulation time called Approximate Time, where the simulation's knowledge about the values that represent time is uncertain. The a...
Margaret L. Loper, Richard M. Fujimoto
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
14 years 2 months ago
Landmark Selection for Task-Oriented Navigation
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni
SAC
2009
ACM
14 years 3 months ago
A gradient oriented recombination scheme for evolution strategies
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
Haifeng Chen, Guofei Jiang
DAM
1999
132views more  DAM 1999»
13 years 8 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian