Sciweavers

1563 search results - page 115 / 313
» Performance comparison of memetic algorithms
Sort
View
IROS
2007
IEEE
123views Robotics» more  IROS 2007»
15 years 9 months ago
Learning humanoid reaching tasks in dynamic environments
— A central challenging problem in humanoid robotics is to plan and execute dynamic tasks in dynamic environments. Given that the environment is known, sampling-based online moti...
Xiaoxi Jiang, Marcelo Kallmann
121
Voted
BMCBI
2010
90views more  BMCBI 2010»
15 years 3 months ago
Local alignment of generalized k-base encoded DNA sequence
Background: DNA sequence comparison is a well-studied problem, in which two DNA sequences are compared using a weighted edit distance. Recent DNA sequencing technologies however o...
Nils Homer, Stanley F. Nelson, Barry Merriman
CP
2005
Springer
15 years 5 months ago
Evolving Variable-Ordering Heuristics for Constrained Optimisation
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
Stuart Bain, John Thornton, Abdul Sattar
225
Voted
ICDE
2006
IEEE
110views Database» more  ICDE 2006»
16 years 4 months ago
Detecting Duplicates in Complex XML Data
Recent work both in the relational and the XML world have shown that the efficacy and efficiency of duplicate detection is enhanced by regarding relationships between entities. Ho...
Melanie Weis, Felix Naumann
106
Voted
CGO
2007
IEEE
15 years 9 months ago
Understanding Tradeoffs in Software Transactional Memory
There has been a flurry of recent work on the design of high performance software and hybrid hardware/software transactional memories (STMs and HyTMs). This paper reexamines the ...
David Dice, Nir Shavit