17366 search results - page 102 / 3474 » New Revision Algorithms |
134
click to vote
GBRPR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this paper, we present a topological algorithm which allows to ll contours images. The lling problem has been widely treated and it recently appeared that it can alw...
148
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
135
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
134
click to vote
IWMM
2009
Springer
15 years 10 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
116
Voted
IPM
2008
15 years 3 months ago
2008
In the last few years, there is an increasing interest to generate visual representations of very large scientific domains. A methodology based on the combined use of ISI