Sciweavers

1884 search results - page 14 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
AAIM
2010
Springer
219views Algorithms» more  AAIM 2010»
15 years 1 months ago
Approximating Maximum Edge 2-Coloring in Simple Graphs
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita
GD
2001
Springer
15 years 2 months ago
Fast and Simple Horizontal Coordinate Assignment
Abstract. We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to ...
Ulrik Brandes, Boris Köpf
CAIP
2007
Springer
125views Image Analysis» more  CAIP 2007»
15 years 1 months ago
Euclidean Shortest Paths in Simple Cube Curves at a Glance
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...
Fajie Li, Reinhard Klette
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 4 months ago
Rigorous analyses of simple diversity mechanisms
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
IPL
2007
91views more  IPL 2007»
14 years 9 months ago
Simple deterministic wildcard matching
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
Peter Clifford, Raphaël Clifford