Sciweavers

935 search results - page 108 / 187
» A New Statistical Optimization Algorithm for Gate Sizing
Sort
View
ICML
2006
IEEE
16 years 4 months ago
PAC model-free reinforcement learning
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
Alexander L. Strehl, Lihong Li, Eric Wiewiora, Joh...
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
15 years 5 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
SIGSOFT
2010
ACM
15 years 1 months ago
Software is data too
Software systems are designed and engineered to process data. However, software is data too. The size and variety of today's software artifacts and the multitude of stakehold...
Andrian Marcus, Tim Menzies
MICRO
1997
IEEE
116views Hardware» more  MICRO 1997»
15 years 7 months ago
Tuning Compiler Optimizations for Simultaneous Multithreading
Compiler optimizations are often driven by specific assumptions about the underlying architecture and implementation of the target machine. For example, when targeting shared-mem...
Jack L. Lo, Susan J. Eggers, Henry M. Levy, Sujay ...
DEXAW
2010
IEEE
196views Database» more  DEXAW 2010»
15 years 3 months ago
Direct Optimization of Evaluation Measures in Learning to Rank Using Particle Swarm
— One of the central issues in Learning to Rank (L2R) for Information Retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures ...
Ósscar Alejo, Juan M. Fernández-Luna...