Sciweavers

1985 search results - page 108 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
93
Voted
GECCO
1999
Springer
15 years 8 months ago
Infrastructure Work Order Planning Using Genetic Algorithms
Infrastructure management offices plan and complete several thousand small construction projects annually. Effective planning is vital if the public and private sectors are to mai...
E. William East
128
Voted
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 3 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
137
Voted
CCE
2004
15 years 3 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
138
Voted
ROBOTICA
2002
72views more  ROBOTICA 2002»
15 years 3 months ago
Point-to-Point trajectory planning of flexible redundant robot manipulators using genetic algorithms
: The paper focuses on the problem of point-to-point trajectory planning for flexible redundant robot manipulators (FRM) in joint space. Compared with irredundant flexible manipula...
Shigang Yue, Dominik Henrich, W. L. Xu, S. K. Tso
172
Voted
ALGORITHMICA
2011
14 years 10 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro