Sciweavers

1763 search results - page 214 / 353
» A Formalization of Polytime Functions
Sort
View
BPM
2010
Springer
186views Business» more  BPM 2010»
14 years 11 months ago
How to Implement a Theory of Correctness in the Area of Business Processes and Services
During the previous years, we presented several results concerned with various issues related to the correctness of models for business processes and services (i. e., interorganiza...
Niels Lohmann, Karsten Wolf
CONCUR
2010
Springer
14 years 11 months ago
Kleene, Rabin, and Scott Are Available
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger ...
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
14 years 11 months ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
ICML
2010
IEEE
14 years 11 months ago
Internal Rewards Mitigate Agent Boundedness
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
Jonathan Sorg, Satinder P. Singh, Richard Lewis
CSL
2010
Springer
14 years 10 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann