Sciweavers

3637 search results - page 561 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
EUROCAST
2005
Springer
133views Hardware» more  EUROCAST 2005»
16 years 22 hour ago
An Iterative Method for Mining Frequent Temporal Patterns
The incorporation of temporal semantic into the traditional data mining techniques has caused the creation of a new area called Temporal Data Mining. This incorporation is especial...
Francisco Guil, Antonio B. Bailón, Alfonso ...
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
16 years 18 hour ago
An autonomous explore/exploit strategy
In reinforcement learning problems it has been considered that neither exploitation nor exploration can be pursued exclusively without failing at the task. The optimal balance bet...
Alex McMahon, Dan Scott, William N. L. Browne
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
16 years 18 hour ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
HIPC
2005
Springer
16 years 16 hour ago
XCAT-C++: Design and Performance of a Distributed CCA Framework
In this paper we describe the design and implementation of a C++ based Common Component Architecture (CCA) framework, XCAT-C++. It can efficiently marshal and unmarshal large data...
Madhusudhan Govindaraju, Michael R. Head, Kenneth ...
HIPEAC
2005
Springer
16 years 16 hour ago
A Practical Method for Quickly Evaluating Program Optimizations
This article aims at making iterative optimization practical and usable by speeding up the evaluation of a large range of optimizations. Instead of using a full run to evaluate a s...
Grigori Fursin, Albert Cohen, Michael F. P. O'Boyl...