Sciweavers

8540 search results - page 1375 / 1708
» The Dynamic Servers Problem
Sort
View
BCSHCI
2007
15 years 6 months ago
Cueing retrospective verbal reports in usability testing through eye-movement replay
An experimental validation is presented of a novel method for usability testing that entails the playback of dynamic eyetracking data to cue the elicitation of retrospective verba...
Nicola Eger, Linden J. Ball, Robert Stevens, Jon D...
UAI
2008
15 years 6 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
ATAL
2010
Springer
15 years 5 months ago
Deception in networks of mobile sensing agents
Recent studies have investigated how a team of mobile sensors can cope with real world constraints, such as uncertainty in the reward functions, dynamically appearing and disappea...
Viliam Lisý, Roie Zivan, Katia P. Sycara, M...
4OR
2010
137views more  4OR 2010»
15 years 4 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
BMCBI
2010
183views more  BMCBI 2010»
15 years 4 months ago
SOPRA: Scaffolding algorithm for paired reads via statistical optimization
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
Adel Dayarian, Todd P. Michael, Anirvan M. Sengupt...
« Prev « First page 1375 / 1708 Last » Next »