Sciweavers

306 search results - page 60 / 62
» Dynamic Software Updates: The State Mapping Problem
Sort
View
JAIR
2006
157views more  JAIR 2006»
13 years 6 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
14 years 26 days ago
A k-NN Based Perception Scheme for Reinforcement Learning
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
José Antonio Martin H., Javier de Lope Asia...
IROS
2006
IEEE
202views Robotics» more  IROS 2006»
14 years 21 days ago
Topological characterization of mobile robot behavior
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...
Aurélien Hazan, Frédéric Dave...
CC
1998
Springer
111views System Software» more  CC 1998»
13 years 6 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson
BMCBI
2011
12 years 10 months ago
Efficient alignment of pyrosequencing reads for re-sequencing applications
Background: Over the past few years, new massively parallel DNA sequencing technologies have emerged. These platforms generate massive amounts of data per run, greatly reducing th...
Francisco Fernandes, Paulo G. S. da Fonseca, Lu&ia...