Sciweavers

13041 search results - page 236 / 2609
» Simulating space and time
Sort
View
ECSQARU
2001
Springer
15 years 10 months ago
Space-Progressive Value Iteration: An Anytime Algorithm for a Class of POMDPs
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...
Nevin Lianwen Zhang, Weihong Zhang
SWAT
1992
Springer
116views Algorithms» more  SWAT 1992»
15 years 10 months ago
Sorting Multisets Stably in Minimum Space
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
Jyrki Katajainen, Tomi Pasanen
CIKM
2006
Springer
15 years 10 months ago
Approximate reverse k-nearest neighbor queries in general metric spaces
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
Elke Achtert, Christian Böhm, Peer Kröge...
WSC
1997
15 years 7 months ago
Activate This Classroom at Time Now
Active and cooperative learning methods represent a paradigm shift in the delivery of engineering education. These techniques recognize that the passive model of the typical colle...
Manuel D. Rossetti
149
Voted
DATE
2006
IEEE
88views Hardware» more  DATE 2006»
16 years 6 days ago
Using conjugate symmetries to enhance gate-level simulations
State machine based simulation of Boolean functions is substantially faster if the function being simulated is symmetric. Unfortunately function symmetries are comparatively rare....
Peter M. Maurer