Sciweavers

1332 search results - page 72 / 267
» Combinatorial Algorithms
Sort
View
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
14 years 2 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
JPDC
2006
134views more  JPDC 2006»
13 years 9 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong

Book
3022views
15 years 5 months ago
Algorithms for Programmers
"This is the (work in progress) book "Algorithms for Programmers". Publication as soon as possible, content is (modulo copy editing) close to final version. I will p...
Jörg Arndt
MVA
1998
230views Computer Vision» more  MVA 1998»
13 years 10 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
CORR
2007
Springer
148views Education» more  CORR 2007»
13 years 9 months ago
Linear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...