Sciweavers

9626 search results - page 481 / 1926
» Invariant Based Programming
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Constraint relaxation in approximate linear programs
Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for...
Marek Petrik, Shlomo Zilberstein
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
ICRA
2009
IEEE
147views Robotics» more  ICRA 2009»
16 years 1 months ago
Equipping robot control programs with first-order probabilistic reasoning capabilities
— An autonomous robot system that is to act in a real-world environment is faced with the problem of having to deal with a high degree of both complexity as well as uncertainty. ...
Dominik Jain, Lorenz Mösenlechner, Michael Be...
ACISICIS
2008
IEEE
16 years 1 months ago
An Integer Linear Programming Approach for Dedicated Machine Constraint
Dedicated machine constraint is one of the new challenges introduced in photolithography machinery of the semiconductor manufacturing system due to natural bias. Previous research...
Huy Nguyen Anh Pham, Arthur M. D. Shr, Peter P. Ch...
APSEC
2008
IEEE
16 years 1 months ago
Correctness of Request Executions in Online Updates of Concurrent Object Oriented Programs
Online update is a technique that reduces the disruption caused by a software update. It does so by applying a patch to a running process as opposed to shutting down the process a...
Yogesh Murarka, Umesh Bellur