Sciweavers

2989 search results - page 193 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
82
Voted
APLAS
2009
ACM
15 years 4 months ago
A Short Cut to Optimal Sequences
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
Akimasa Morihata
67
Voted
HASE
2007
IEEE
15 years 4 months ago
Pattern-Based Modeling and Analysis of Failsafe Fault-Tolerance in UML
In order to facilitate incremental modeling and analysis of fault-tolerant embedded systems, we introduce an object analysis pattern, called the detector pattern, that provides a ...
Ali Ebnenasir, Betty H. C. Cheng
COLING
1992
14 years 11 months ago
A Constraint-Based Approach To Translating Anaphoric Dependencies
The normal method for representing anaphoric dependencies in Unification Based grammar tbrmalisms is that of re-entrance. In this paper, we address the problems that this represen...
Louisa Sadler, Doug Arnold
90
Voted
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
14 years 5 months ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto
CVPR
2010
IEEE
15 years 3 months ago
Minimum length in the tangent bundle as a model for curve completion
The phenomenon of visual curve completion, where the visual system completes the missing part (e.g., due to occlusion) between two contour fragments, is a major problem in percept...
Guy Ben-Yosef, Ohad Ben Shahar