Sciweavers

2620 search results - page 223 / 524
» An Evaluation Technique for Binarization Algorithms
Sort
View
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
16 years 7 months ago
Holistic UDAFs at streaming speeds
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
Graham Cormode, Theodore Johnson, Flip Korn, S. Mu...
185
Voted
SARA
2007
Springer
16 years 28 days ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu
WECWIS
2005
IEEE
141views ECommerce» more  WECWIS 2005»
16 years 12 days ago
An Adaptive Bilateral Negotiation Model for E-Commerce Settings
This paper studies adaptive bilateral negotiation between software agents in e-commerce environments. Specifically, we assume that the agents are self-interested, the environment...
Vidya Narayanan, Nicholas R. Jennings
ASPDAC
2004
ACM
151views Hardware» more  ASPDAC 2004»
16 years 7 days ago
Combinatorial group testing methods for the BIST diagnosis problem
— We examine an abstract formulation of BIST diagnosis in digital logic systems. The BIST diagnosis problem has applications that include identification of erroneous test vector...
Andrew B. Kahng, Sherief Reda
SAC
2004
ACM
16 years 7 days ago
Caching in Web memory hierarchies
Web cache replacement algorithms have received a lot of attention during the past years. Though none of the proposed algorithms deals efficiently with all the particularities of t...
Dimitrios Katsaros, Yannis Manolopoulos