Sciweavers

1639 search results - page 231 / 328
» Anytime Heuristic Search
Sort
View
IEICET
2006
55views more  IEICET 2006»
13 years 8 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
JBI
2006
13 years 8 months ago
Support versus corroboration
Numerous metrics have been developed that attempt to assess the reliability of phylogenetic trees. Several of these commonly used measures of tree and tree branch support are desc...
Mary G. Egan
JUCS
2008
159views more  JUCS 2008»
13 years 8 months ago
Two Step Swarm Intelligence to Solve the Feature Selection Problem
: In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two sta...
Yudel Gómez, Rafael Bello, Amilkar Puris, M...
KES
2006
Springer
13 years 8 months ago
A computational framework for package planning
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
Yang Xiang, Michael Janzen
TEC
2008
98views more  TEC 2008»
13 years 8 months ago
A Fast Incremental Hypervolume Algorithm
When hypervolume is used as part of the selection or archiving process in a multiobjective evolutionary algorithm, it is necessary to determine which solutions contribute the least...
Lucas Bradstreet, R. Lyndon While, Luigi Barone