Sciweavers

6514 search results - page 568 / 1303
» Low-Knowledge Algorithm Control
Sort
View
ICRA
2007
IEEE
106views Robotics» more  ICRA 2007»
16 years 21 days ago
Exploring Different Coherence Dimensions to Answer Proximity Queries for Convex Polyhedra
— Different coherence dimensions can be considered to improve the performances of an algorithm for computing collision translations of pairs of convex polyhedra. The algorithm’...
Claudio Mirolo, Stefano Carpin, Enrico Pagello
RTSS
2007
IEEE
16 years 20 days ago
Generalized Tardiness Bounds for Global Multiprocessor Scheduling
We consider the issue of deadline tardiness under global multiprocessor scheduling algorithms. We present a general tardiness-bound derivation that is applicable to a wide variety...
Hennadiy Leontyev, James H. Anderson
VTC
2007
IEEE
164views Communications» more  VTC 2007»
16 years 19 days ago
Joint Distributed Clustering and Ranging for Wireless Ad-Hoc Sensor Networks
— This paper discusses a joint decentralized clustering and ranging algorithm for wireless ad-hoc sensor networks. Each sensor uses a random waiting timer and local criteria to d...
Chih-Yu Wen, Jun-Koh Chen, William A. Sethares
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
16 years 16 days ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
15 years 12 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan