Sciweavers

1101 search results - page 59 / 221
» heuristics 2007
Sort
View
BIOINFORMATICS
2007
88views more  BIOINFORMATICS 2007»
13 years 9 months ago
Maximum likelihood of phylogenetic networks
Horizontal gene transfer (HGT) is believed to be ubiquitous among bacteria, and plays a major role in their genome diversification as well as their ability to develop resistance t...
Guohua Jin, Luay Nakhleh, Sagi Snir, Tamir Tuller
JUCS
2007
148views more  JUCS 2007»
13 years 9 months ago
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
Adrian Dumitrescu, Csaba D. Tóth
NETWORKING
2007
13 years 11 months ago
Optimal Topology Design for Overlay Networks
Abstract. The topology creation is one of the most important step for the design of an overlay network. Traffic characteristic and volume, and behavior of nodes which can be sel...
Mina Kamel, Caterina M. Scoglio, Todd Easton
IJCAI
1997
13 years 11 months ago
Interleaved Depth-First Search
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
Pedro Meseguer
ANOR
2005
56views more  ANOR 2005»
13 years 9 months ago
Two-Machine Flowshop Batching and Scheduling
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
Bertrand M. T. Lin, T. C. Edwin Cheng