Sciweavers

2479 search results - page 215 / 496
» A Computational Theory of Working Memory
Sort
View
ICCD
1997
IEEE
123views Hardware» more  ICCD 1997»
14 years 1 months ago
A Parallel Circuit-Partitioned Algorithm for Timing Driven Cell Placement
Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process. All previous work in parallel simulated annealing bas...
John A. Chandy, Prithviraj Banerjee
FLAIRS
2004
13 years 10 months ago
A Faster Algorithm for Generalized Multiple-Instance Learning
In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag's label is not based on a single instance's proximity to a...
Qingping Tao, Stephen D. Scott
CCR
2008
94views more  CCR 2008»
13 years 9 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 9 months ago
Metric State Space Reinforcement Learning for a Vision-Capable Mobile Robot
We address the problem of autonomously learning controllers for visioncapable mobile robots. We extend McCallum's (1995) Nearest-Sequence Memory algorithm to allow for genera...
Viktor Zhumatiy, Faustino J. Gomez, Marcus Hutter,...
BICA
2010
13 years 4 months ago
Validating a High Level Behavioral Representation Language (HERBAL): A Docking Study for ACT-R
We present a docking study for Herbal, a high-level behavioral representation language based on the problem space computational model. This study docks an ACT-R model created with ...
Changkun Zhao, Jaehyon Paik, Jonathan H. Morgan, F...