Sciweavers

4894 search results - page 645 / 979
» Choices
Sort
View
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 10 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
APWEB
2006
Springer
15 years 10 months ago
The Case of the Duplicate Documents Measurement, Search, and Science
Many of the documents in large text collections are duplicates and versions of each other. In recent research, we developed new methods for finding such duplicates; however, as the...
Justin Zobel, Yaniv Bernstein
CGO
2004
IEEE
15 years 10 months ago
Exploring Code Cache Eviction Granularities in Dynamic Optimization Systems
Dynamic optimization systems store optimized or translated code in a software-managed code cache in order to maximize reuse of transformed code. Code caches store superblocks that...
Kim M. Hazelwood, James E. Smith
ASWEC
2006
IEEE
15 years 10 months ago
Requirements Capture and Specification for Enterprise Applications: a UML Based Attempt
We propose a software development method for enterprise applications that combines the use of the structural concepts provided by problem frames, and the use of the UML notation. ...
Christine Choppy, Gianna Reggio
ATAL
2006
Springer
15 years 10 months ago
Probabilistic policy reuse in a reinforcement learning agent
We contribute Policy Reuse as a technique to improve a reinforcement learning agent with guidance from past learned similar policies. Our method relies on using the past policies ...
Fernando Fernández, Manuela M. Veloso