Sciweavers

10890 search results - page 14 / 2178
» Automatic Complexity Analysis
Sort
View
AIPS
1994
13 years 8 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
13 years 11 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
13 years 11 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
CVBIA
2005
Springer
14 years 1 months ago
Automatic Extraction of Femur Contours from Hip X-Ray Images
Abstract. Extraction of bone contours from x-ray images is an important first step in computer analysis of medical images. It is more complex than the segmentation of CT and MR im...
Ying Chen, Xianhe Ee, Wee Kheng Leow, Tet Sen Howe
IWPC
1996
IEEE
13 years 11 months ago
Evaluating process clusters to support automatic program understanding
Evaluating the design of a distributed application is di cult but provides useful information for program development and maintenance. In distributed debugging, for example, proce...
Thomas Kunz