Sciweavers

75 search results - page 9 / 15
» On the Strength of Size Limits in Linear Genetic Programming
Sort
View
SSD
2005
Springer
188views Database» more  SSD 2005»
14 years 5 days ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar
CEC
2007
IEEE
14 years 1 months ago
A histogram-matching approach to the evolution of bin-packing strategies
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
Riccardo Poli, John Woodward, Edmund K. Burke
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
13 years 10 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
INFOSCALE
2006
ACM
14 years 20 days ago
Scalable hardware accelerator for comparing DNA and protein sequences
Abstract— Comparing genetic sequences is a well-known problem in bioinformatics. Newly determined sequences are being compared to known sequences stored in databases in order to ...
Philippe Faes, Bram Minnaert, Mark Christiaens, Er...
ICRA
2002
IEEE
161views Robotics» more  ICRA 2002»
13 years 11 months ago
A Method for Co-Evolving Morphology and Walking Pattern of Biped Humanoid Robot
— In this paper, we present a method for co-evolving structures and controller of biped walking robots. Currently, biped walking humanoid robots are designed manually on trial-an...
Ken Endo, Fuminori Yamasaki, Takashi Maeno, Hiroak...