2989 search results - page 193 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
147
click to vote
APLAS
2009
ACM
16 years 20 days ago
2009
ACM
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 ...
136
Voted
HASE
2007
IEEE
16 years 14 days ago
2007
IEEE
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 ...
160
click to vote
COLING
1992
15 years 7 months ago
1992
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...
169
Voted
SBMF
2010
Springer
15 years 27 days ago
2010
Springer
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...
143
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
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...