Sciweavers

620 search results - page 30 / 124
» Towards Optimal Bayesian Algorithmic Mechanism Design
Sort
View
CVPR
2000
IEEE
14 years 9 months ago
Representation and Optimal Recognition of Human Activities
Towards the goal of realizing a generic automatichuman activity recognition system, a new formalism is proposed. Activities are described by a chained hierarchical representation ...
François Brémond, Ramakant Nevatia, ...
CODES
2003
IEEE
14 years 25 days ago
Design space minimization with timing and code size optimization for embedded DSP
One of the most challenging problems in high-level synthesis is how to quickly explore a wide range of design options to achieve high-quality designs. This paper presents an Integ...
Qingfeng Zhuge, Zili Shao, Bin Xiao, Edwin Hsing-M...
FPGA
2010
ACM
232views FPGA» more  FPGA 2010»
13 years 7 months ago
High-throughput bayesian computing machine with reconfigurable hardware
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
Mingjie Lin, Ilia Lebedev, John Wawrzynek
ATAL
2008
Springer
13 years 9 months ago
No-regret learning and a mechanism for distributed multiagent planning
We develop a novel mechanism for coordinated, distributed multiagent planning. We consider problems stated as a collection of single-agent planning problems coupled by common soft...
Jan-P. Calliess, Geoffrey J. Gordon
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
13 years 5 months ago
Improved analysis methods for crossover-based algorithms
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Benjamin Doerr, Madeleine Theile