7986 search results - page 276 / 1598 » Computational Science and its Applications |
141
click to vote
STACS
2004
Springer
15 years 12 months ago
2004
Springer
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...
185
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
167
Voted
GI
2009
Springer
15 years 11 months ago
2009
Springer
: The modeling of strategies for deriving valid project plans is a core task in development process’s design. Strategies are used for planning and for the validation of concrete ...
157
click to vote
CSR
2010
Springer
15 years 10 months ago
2010
Springer
We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the subshift, and we are interested in its complexity in terms of r...
148
click to vote
MFCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...