Sciweavers

49 search results - page 8 / 10
» Approachability of Convex Sets in Games with Partial Monitor...
Sort
View
AAAI
2012
11 years 10 months ago
Learning from Demonstration for Goal-Driven Autonomy
Goal-driven autonomy (GDA) is a conceptual model for creating an autonomous agent that monitors a set of expectations during plan execution, detects when discrepancies occur, buil...
Ben George Weber, Michael Mateas, Arnav Jhala
ICSE
2010
IEEE-ACM
13 years 9 months ago
Efficient hybrid typestate analysis by determining continuation-equivalent states
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
Eric Bodden
SAS
1999
Springer
106views Formal Methods» more  SAS 1999»
13 years 12 months ago
Static Analyses for Eliminating Unnecessary Synchronization from Java Programs
This paper presents and evaluates a set of analyses designed to reduce synchronization overhead in Java programs. Monitor-based synchronization in Java often causes significant ove...
Jonathan Aldrich, Craig Chambers, Emin Gün Si...
LION
2010
Springer
190views Optimization» more  LION 2010»
13 years 11 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
ICRA
2008
IEEE
117views Robotics» more  ICRA 2008»
14 years 2 months ago
Tracking hidden agents through shadow information spaces
— This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry sensors. The agents move unpredictably and may ...
Jingjin Yu, Steven M. LaValle