Sciweavers

187 search results - page 25 / 38
» Optimal strategies in sequential bidding
Sort
View
DATE
1999
IEEE
102views Hardware» more  DATE 1999»
15 years 2 months ago
Minimal Length Diagnostic Tests for Analog Circuits using Test History
In this paper we propose an efficient transient test generation method to comprehensively test analog circuits using minimum test time. A divide and conquer strategy is formulated...
Alfred V. Gomes, Abhijit Chatterjee
CP
2010
Springer
14 years 7 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
ECAI
2006
Springer
15 years 1 months ago
Possibilistic Influence Diagrams
Abstract. In this article we present the framework of Possibilistic Influence Diagrams (PID), which allow to model in a compact form problems of sequential decision making under un...
Laurent Garcia, Régis Sabbadin
GLOBECOM
2007
IEEE
15 years 1 months ago
Bursty Traffic in Energy-Constrained Opportunistic Spectrum Access
We design opportunistic spectrum access strategies for improving spectrum efficiency. In each slot, a secondary user chooses a subset of channels to sense and decides whether to ac...
Yunxia Chen, Qing Zhao, Ananthram Swami
77
Voted
ATAL
2004
Springer
15 years 3 months ago
A Study of Limited-Precision, Incremental Elicitation in Auctions
We investigate the design of iterative, limited-precision mechanisms for single-good auctions with dominant strategy equilibria. Our aim is to design mechanisms that minimize the ...
Alexander Kress, Craig Boutilier