Sciweavers

3161 search results - page 75 / 633
» A Discourse on Complexity of Process Models
Sort
View
GRAMMARS
2002
119views more  GRAMMARS 2002»
14 years 9 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
SPE
2002
141views more  SPE 2002»
14 years 9 months ago
Data collection and restoration for heterogeneous process migration
This study presents a practical solution for data collection and restoration to migrate a process written in high level stack-based languages such as C and Fortran over a network ...
Kasidit Chanchio, Xian-He Sun
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 5 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
CORR
2008
Springer
208views Education» more  CORR 2008»
14 years 10 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
PDC
2004
ACM
15 years 3 months ago
Socio-technical walkthrough: designing technology along work processes
How can the documentation of concepts for complex sociotechnical systems, such as the adoption of groupware, be incorporated into practices of PD? Documents are important in suppo...
Thomas Herrmann, Gabriele Kunau, Kai-Uwe Loser, Na...