Sciweavers

5889 search results - page 1013 / 1178
» Graph Layout Problems
Sort
View
DAGSTUHL
1996
15 years 3 months ago
A Self-Applicable Supercompiler
A supercompiler is a program which can performa deep transformation of programsusing a principle which is similarto partial evaluation, and can be referred to as metacomputation. ...
Andrei P. Nemytykh, Victoria A. Pinchuk, Valentin ...
113
Voted
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 3 months ago
Enhanced generalized ant programming (EGAP)
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
Amirali Salehi-Abari, Tony White
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 3 months ago
The study for transportation planning considered the inventory using hybrid genetic algorithm
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
Shinichiro Ataka, Mitsuo Gen
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 2 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
CVPR
2008
IEEE
15 years 2 months ago
Globally optimal surface segmentation using regional properties of segmented objects
Efficient segmentation of globally optimal surfaces in volumetric images is a central problem in many medical image analysis applications. Intra-class variance has been successful...
Xin Dou, Xiaodong Wu, Andreas Wahle, Milan Sonka
« Prev « First page 1013 / 1178 Last » Next »