Sciweavers

2657 search results - page 193 / 532
» On the complexity of hierarchical problem solving
Sort
View
TON
2002
99views more  TON 2002»
15 years 1 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
15 years 7 months ago
Co-evolving recurrent neurons learn deep memory POMDPs
Recurrent neural networks are theoretically capable of learning complex temporal sequences, but training them through gradient-descent is too slow and unstable for practical use i...
Faustino J. Gomez, Jürgen Schmidhuber
ISAAC
2004
Springer
117views Algorithms» more  ISAAC 2004»
15 years 7 months ago
Adaptive Spatial Partitioning for Multidimensional Data Streams
We propose a space-efficient scheme for summarizing multidimensional data streams. Our sketch can be used to solve spatial versions of several classical data stream queries effici...
John Hershberger, Nisheeth Shrivastava, Subhash Su...
ISMIS
2003
Springer
15 years 7 months ago
NETMARK: A Schema-Less Extension for Relational Databases for Managing Semi-structured Data Dynamically
Object-Relational database management system is an integrated hybrid cooperative approach to combine the best practices of both the relational model utilizing SQL queries and the ...
David A. Maluf, Peter B. Tran
ATAL
2006
Springer
15 years 5 months ago
Action awareness: enabling agents to optimize, transform, and coordinate plans
As agent systems are solving more and more complex tasks in increasingly challenging domains, the systems themselves are becoming more complex too, often compromising their adapti...
Freek Stulp, Michael Beetz