Sciweavers

71228 search results - page 177 / 14246
» Algorithms
Sort
View
MST
2008
157views more  MST 2008»
15 years 1 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot
NETWORKS
2006
15 years 1 months ago
Lower bounds for the relative greedy algorithm for approximating Steiner trees
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
Stefan Hougardy, Stefan Kirchner
ITA
2007
15 years 1 months ago
An algorithm for deciding if a polyomino tiles the plane
: For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate f...
Ian Gambini, Laurent Vuillon
EATCS
2002
100views more  EATCS 2002»
15 years 1 months ago
Bead-Sort: A Natural Sorting Algorithm
Nature is not only a source of minerals and precious stones but is also a mine of algorithms. By observing and studying natural phenomena, computer algorithms can be extracted. In...
Joshua J. Arulanandham, Cristian Calude, Michael J...
SCJAPAN
2000
136views more  SCJAPAN 2000»
15 years 1 months ago
Acceleration of the EM algorithm
The EM algorithm is widely used to estimate the parameters of many applications. It is simple but the convergence speed is slow. There is another algorithm called the scoring metho...
Shiro Ikeda
« Prev « First page 177 / 14246 Last » Next »