Sciweavers

699 search results - page 67 / 140
» The method of combinatorial telescoping
Sort
View
89
Voted
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
15 years 4 months ago
Multi-objective genetic algorithms for pipe arrangement design
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...
Satoshi Ikehira, Hajime Kimura
ISER
2000
Springer
117views Robotics» more  ISER 2000»
15 years 4 months ago
Motion Planning for a Self-Reconfigurable Modular Robot
: This paper addresses motion planning of a homogeneous modular robotic system. The modules have self-reconfiguration capability so that a group of the modules can construct a robo...
Eiichi Yoshida, Satoshi Murata, Akiya Kamimura, Ko...
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 2 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
92
Voted
BMCBI
2008
136views more  BMCBI 2008»
15 years 21 days ago
A comparison of machine learning algorithms for chemical toxicity classification using a simulated multi-scale data model
Background: Bioactivity profiling using high-throughput in vitro assays can reduce the cost and time required for toxicological screening of environmental chemicals and can also r...
Richard Judson, Fathi Elloumi, R. Woodrow Setzer, ...
NCA
2008
IEEE
15 years 16 days ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...