Sciweavers

1096 search results - page 75 / 220
» Computation Slicing: Techniques and Theory
Sort
View
COLING
1994
13 years 9 months ago
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
Emmanuel Roche
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 8 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
WM
2003
13 years 9 months ago
Worlds, Models, and KM
Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models t...
Cyrus F. Nourani
CVIU
2007
128views more  CVIU 2007»
13 years 8 months ago
Iterative relative fuzzy connectedness for multiple objects with multiple seeds
In this paper we present a new theory and an algorithm for image segmentation based on a strength of connectedness between every pair of image elements. The object definition use...
Krzysztof Ciesielski, Jayaram K. Udupa, Punam K. S...
SIGSOFT
2006
ACM
14 years 1 months ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba