Sciweavers

4894 search results - page 324 / 979
» Dynamic Abstraction Planning
Sort
View
ICSOFT
2008
15 years 8 months ago
Defining and Prototyping a Life-cycle for Dynamic Service Composition
Abstract. Since the Internet has become a commodity in both wired and wireless environments, new applications and paradigms have emerged to explore this highly distributed and wide...
Eduardo Goncalves da Silva, Jorge Martínez ...
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior of a typical po...
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
JDA
2006
184views more  JDA 2006»
15 years 6 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
AR
2002
157views more  AR 2002»
15 years 6 months ago
Acquiring state from control dynamics to learn grasping policies for robot hands
Abstract--A prominent emerging theory of sensorimotor development in biological systems proposes that control knowledge is encoded in the dynamics of physical interaction with the ...
Roderic A. Grupen, Jefferson A. Coelho Jr.
ICDCN
2009
Springer
16 years 1 months ago
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
Amos Korman