Sciweavers

916 search results - page 56 / 184
» Algorithm selection: a quantitative computation-intensive op...
Sort
View
TON
2002
75views more  TON 2002»
15 years 2 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
UAI
2008
15 years 4 months ago
Observation Subset Selection as Local Compilation of Performance Profiles
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
Yan Radovilsky, Solomon Eyal Shimony
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 8 months ago
An effective use of crowding distance in multiobjective particle swarm optimization
In this paper, we present an approach that extends the Particle Swarm Optimization (PSO) algorithm to handle multiobjective optimization problems by incorporating the mechanism of...
Carlo R. Raquel, Prospero C. Naval Jr.
ROBIO
2006
IEEE
129views Robotics» more  ROBIO 2006»
15 years 8 months ago
Learning Utility Surfaces for Movement Selection
— Humanoid robots are highly redundant systems with respect to the tasks they are asked to perform. This redundancy manifests itself in the number of degrees of freedom of the ro...
Matthew Howard, Michael Gienger, Christian Goerick...
GECCO
2005
Springer
122views Optimization» more  GECCO 2005»
15 years 8 months ago
Map-labelling with a multi-objective evolutionary algorithm
We present a multi-objective evolutionary algorithm approach to the map-labelling problem. Map-labelling involves placing labels for sites onto a map such that the result is easy ...
Lucas Bradstreet, Luigi Barone, R. Lyndon While