Sciweavers

247 search results - page 34 / 50
» Optimal Preemptive Scheduling for General Target Functions
Sort
View
174
Voted
ECML
2006
Springer
15 years 7 months ago
Task-Driven Discretization of the Joint Space of Visual Percepts and Continuous Actions
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...
Sébastien Jodogne, Justus H. Piater
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
15 years 9 months ago
MRBUG: A Competitive Multi-Robot Path Finding Algorithm
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
160
Voted
ATAL
2011
Springer
14 years 3 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
125
Voted
SENSYS
2003
ACM
15 years 8 months ago
Differentiated surveillance for sensor networks
For many sensor network applications such as military surveillance, it is necessary to provide full sensing coverage to a security-sensitive area while at the same time minimizing...
Ting Yan, Tian He, John A. Stankovic
GLVLSI
2007
IEEE
151views VLSI» more  GLVLSI 2007»
15 years 7 months ago
Hand-in-hand verification of high-level synthesis
This paper describes a formal verification methodology of highnthesis (HLS) process. The abstraction level of the input to HLS is so high compared to that of the output that the v...
Chandan Karfa, Dipankar Sarkar, Chittaranjan A. Ma...