Sciweavers

2542 search results - page 285 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
115
Voted
HPCA
2002
IEEE
15 years 5 months ago
Fine-Grain Priority Scheduling on Multi-Channel Memory Systems
Configurations of contemporary DRAM memory systems become increasingly complex. A recent study [5] shows that application performance is highly sensitive to choices of configura...
Zhichun Zhu, Zhao Zhang, Xiaodong Zhang
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
15 years 4 months ago
Grasp Analysis as Linear Matrix Inequality Problems
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
Li Han, Jeffrey C. Trinkle, Zexiang Li
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
15 years 4 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
GECCO
2010
Springer
195views Optimization» more  GECCO 2010»
15 years 4 months ago
Improved step size adaptation for the MO-CMA-ES
The multi-objective covariance matrix adaptation evolution strategy (MO-CMA-ES) is an evolutionary algorithm for continuous vector-valued optimization. It combines indicator-based...
Thomas Voß, Nikolaus Hansen, Christian Igel
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 4 months ago
Adaptation for parallel memetic algorithm based on population entropy
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong