Sciweavers

509 search results - page 69 / 102
» On the completeness of compositional reasoning methods
Sort
View
IROS
2007
IEEE
159views Robotics» more  IROS 2007»
14 years 3 months ago
Transfer of policies based on trajectory libraries
— Libraries of trajectories are a promising way of creating policies for difficult problems. However, often it is not desirable or even possible to create a new library for ever...
Martin Stolle, Hanns Tappeiner, Joel E. Chestnutt,...
FROCOS
2007
Springer
14 years 3 months ago
Temporal Logic with Capacity Constraints
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...
Clare Dixon, Michael Fisher, Boris Konev
WEBI
2007
Springer
14 years 2 months ago
Semantic Convergence of Wikipedia Articles
Social networking, distributed problem solving and human computation have gained high visibility. Wikipedia is a well established service that incorporates aspects of these three ...
Christopher Thomas, Amit P. Sheth
IFM
2005
Springer
14 years 2 months ago
A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
Héctor Ruíz Barradas, Didier Bert
ATS
2002
IEEE
108views Hardware» more  ATS 2002»
14 years 1 months ago
Fault Set Partition for Efficient Width Compression
In this paper, we present a technique for reducing the test length of counter-based pseudo-exhaustive built-in self-testing (BIST) based on width compression method. More formally...
Emil Gizdarski, Hideo Fujiwara