Sciweavers

986 search results - page 19 / 198
» Generalized Goal Programming: polynomial methods and applica...
Sort
View
ICALP
2005
Springer
14 years 1 months ago
The Polyranking Principle
Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variab...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
ASE
2005
140views more  ASE 2005»
13 years 7 months ago
Aspect-Capable Call Path Profiling of Multi-Threaded Java Applications
A primary goal of program performance understanding tools is to focus the user's attention directly on optimization opportunities where significant cost savings may be found....
Robert J. Hall
ZUM
1997
Springer
125views Formal Methods» more  ZUM 1997»
13 years 12 months ago
A Formal OO Method Inspired by Fusion and Object-Z
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
Klaus Achatz, Wolfram Schulte
ICRA
2010
IEEE
133views Robotics» more  ICRA 2010»
13 years 6 months ago
Generalized model learning for Reinforcement Learning on a humanoid robot
— Reinforcement learning (RL) algorithms have long been promising methods for enabling an autonomous robot to improve its behavior on sequential decision-making tasks. The obviou...
Todd Hester, Michael Quinlan, Peter Stone
ESOP
1999
Springer
14 years 1 days ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller