Sciweavers

500 search results - page 58 / 100
» Thread-Modular Abstraction Refinement
Sort
View
WCE
2007
14 years 11 months ago
Utilising Refactoring To Restructure Use-Case Models
—Use case refactoring is one of the recent software engineering techniques that aimed at synthesising and refining use case models. Two new types of use case refactoring are prop...
Ayman Issa
IANDC
2008
81views more  IANDC 2008»
14 years 9 months ago
Universal extensions to simulate specifications
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulat...
Wim H. Hesselink
ICRA
2009
IEEE
196views Robotics» more  ICRA 2009»
14 years 7 months ago
CHOMP: Gradient optimization techniques for efficient motion planning
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...
Nathan D. Ratliff, Matt Zucker, J. Andrew Bagnell,...
CSL
2010
Springer
14 years 10 months ago
Exact Exploration and Hanging Algorithms
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
JCP
2008
139views more  JCP 2008»
14 years 9 months ago
Agent Learning in Relational Domains based on Logical MDPs with Negation
In this paper, we propose a model named Logical Markov Decision Processes with Negation for Relational Reinforcement Learning for applying Reinforcement Learning algorithms on the ...
Song Zhiwei, Chen Xiaoping, Cong Shuang