Sciweavers

1464 search results - page 93 / 293
» On optimal anonymization for l -diversity
Sort
View
AAAI
2011
14 years 6 months ago
Optimal Rewards versus Leaf-Evaluation Heuristics in Planning Agents
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
Jonathan Sorg, Satinder P. Singh, Richard L. Lewis
COLT
2007
Springer
16 years 18 days ago
Bounded Parameter Markov Decision Processes with Average Reward Criterion
Bounded parameter Markov Decision Processes (BMDPs) address the issue of dealing with uncertainty in the parameters of a Markov Decision Process (MDP). Unlike the case of an MDP, t...
Ambuj Tewari, Peter L. Bartlett
TIP
1998
116views more  TIP 1998»
15 years 6 months ago
Line and boundary detection in speckle images
—This paper considers the problem of detecting lines in speckle imagery, such as that produced by synthetic aperture radar (SAR) or ultrasound techniques. Using the physical prin...
Richard N. Czerwinski, Douglas L. Jones, William D...
ICCAD
2010
IEEE
166views Hardware» more  ICCAD 2010»
15 years 4 months ago
Low-power clock trees for CPUs
Clock networks contribute a significant fraction of dynamic power and can be a limiting factor in high-performance CPUs and SoCs. The need for multi-objective optimization over a l...
Dongjin Lee, Myung-Chul Kim, Igor L. Markov
DATE
2005
IEEE
132views Hardware» more  DATE 2005»
16 years 1 days ago
Power-Performance Trade-Offs in Nanometer-Scale Multi-Level Caches Considering Total Leakage
In this paper, we investigate the impact of Tox and Vth on power performance trade-offs for on-chip caches. We start by examining the optimization of the various components of a s...
Robert Bai, Nam Sung Kim, Taeho Kgil, Dennis Sylve...