Sciweavers

2035 search results - page 324 / 407
» Working memory
Sort
View
MASCOTS
2000
15 years 1 months ago
Stateless Routing in Network Simulations
The memory resources required by network simulations can grow quadratically with size of the simulated network. In simulations that use routing tables at each node to perform perh...
George F. Riley, Mostafa H. Ammar, Richard Fujimot...
IJCAI
1997
15 years 1 months ago
Interleaved Depth-First Search
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
Pedro Meseguer
CASCON
1996
114views Education» more  CASCON 1996»
15 years 1 months ago
Modeling on-line rebalancing with priorities and executing on parallel database systems
Because changes to the database (DB) and workload occur during a DB system's lifetime, the physical DB design must evolve to sustain good performance. These changes are carri...
Daniel C. Zilio
MVA
1994
113views Computer Vision» more  MVA 1994»
15 years 1 months ago
A Modified Simulation Environment for Reconfigurable Multicomputer Systems in Digital Image Processing Applications
In our work we improve the EPPI programming environment, which was made in the University of Castilla - la Mancha one year ago. EPPI is a tool for simulating parallel algorithms t...
Francisco J. Quiles, Antonio Jose Garrido del Solo
AIPS
2009
15 years 1 months ago
Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners
Finite-state and memoryless controllers are simple action selection mechanisms widely used in domains such as videogames and mobile robotics. Memoryless controllers stand for func...
Blai Bonet, Héctor Palacios, Hector Geffner