Sciweavers

3320 search results - page 312 / 664
» Heuristics for the Phylogeny Problem
Sort
View
CORR
2010
Springer
148views Education» more  CORR 2010»
15 years 7 months ago
Approximability of the Multiple Stack TSP
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notabl...
Sophie Toulouse
JWSR
2006
113views more  JWSR 2006»
15 years 6 months ago
Search Strategies for Automatic Web Service Composition
: We investigate architectural properties required for supporting automatic service composition. First, composable service architecture will be described, based on modeling Web ser...
Nikola Milanovic, Miroslaw Malek
TCOS
2008
15 years 6 months ago
On Reduct Construction Algorithms
This paper critically analyzes reduct construction methods evels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic g...
Yiyu Yao, Yan Zhao, Jue Wang
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
15 years 6 months ago
A Note on Point Location in Delaunay Triangulations of Random Points
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
Luc Devroye, Ernst P. Mücke, Binhai Zhu
JGO
2010
138views more  JGO 2010»
15 years 5 months ago
Continuous GRASP with a local active-set method for bound-constrained global optimization
Abstract. Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic – based on th...
Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. ...