Sciweavers

1454 search results - page 265 / 291
» Stateful traits and their formalization
Sort
View
96
Voted
ASE
2006
110views more  ASE 2006»
15 years 25 days ago
Runtime recovery and manipulation of software architecture of component-based systems
Recently, more attention is paid to the researches and practices on how to use software architecture in software maintenance and evolution to reduce their complexity and cost. The ...
Gang Huang, Hong Mei, Fuqing Yang
JCS
2006
157views more  JCS 2006»
15 years 22 days ago
Analysis of probabilistic contract signing
We present three case studies, investigating the use of probabilistic model checking to automatically analyse properties of probabilistic contract signing protocols. We use the pr...
Gethin Norman, Vitaly Shmatikov
116
Voted
KI
2006
Springer
15 years 21 days ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
FUIN
2007
130views more  FUIN 2007»
15 years 21 days ago
A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
Thomas Eiter, Esra Erdem, Wolfgang Faber, Já...
87
Voted
IJFCS
2007
105views more  IJFCS 2007»
15 years 20 days ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean