Sciweavers

2747 search results - page 401 / 550
» Non-oblivious Strategy Improvement
Sort
View
GLVLSI
1998
IEEE
129views VLSI» more  GLVLSI 1998»
15 years 3 months ago
Tabu Search Based Circuit Optimization
In this paper we address the problem of optimizing mixed CMOS BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an ta...
Sadiq M. Sait, Habib Youssef, Munir M. Zahra
ICCL
1998
IEEE
15 years 3 months ago
An Infrastructure for Profile-Driven Dynamic Recompilation
Dynamic optimization of computer programs can dramatically improve their performance on a variety of applications. This paper presents an efficient infrastructure for dynamic reco...
Robert G. Burger, R. Kent Dybvig
IPPS
1998
IEEE
15 years 3 months ago
Meta-heuristics for Circuit Partitioning in Parallel Test Generation
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
Consolación Gil, Julio Ortega, Antonio F. D...
ACCV
1998
Springer
15 years 3 months ago
Tracking a Person with Pre-recorded Image Database and a Pan, Tilt, and Zoom Camera
This paper proposes a novel tracking strategy that can robustly track a person or other object within a fixed environment using a pan, tilt, and zoom camera with the help of a pre...
Yiming Ye, John K. Tsotsos, Karen Bennet, Eric Har...
CHI
1998
ACM
15 years 3 months ago
Exploring Browser Design Trade-Offs Using a Dynamical Model of Optimal Information Foraging
Designers and researchers of human-computer interaction need tools that permit the rapid exploration and management of hypotheses about complex interactions of designs, task condi...
Peter Pirolli