Sciweavers

205 search results - page 41 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
ICDE
2003
IEEE
157views Database» more  ICDE 2003»
14 years 7 months ago
Profile-Driven Cache Management
Modern distributed information systems cope with disconnection and limited bandwidth by using caches. In communicationconstrained situations, traditional demand-driven approaches ...
Mitch Cherniack, Eduardo F. Galvez, Michael J. Fra...
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 10 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
EC
2006
121views ECommerce» more  EC 2006»
13 years 6 months ago
A Study of Structural and Parametric Learning in XCS
The performance of a learning classifier system is due to its two main components. First, it evolves new structures by generating new rules in a genetic process; second, it adjust...
Tim Kovacs, Manfred Kerber
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
14 years 6 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
EDBT
2004
ACM
122views Database» more  EDBT 2004»
14 years 6 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...