Sciweavers

1418 search results - page 23 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
IEAAIE
2004
Springer
15 years 7 months ago
Cell Modeling Using Agent-Based Formalisms
The systems biology community is building increasingly complex models and simulations of cells and other biological entities. This community is beginning to look at alternatives t...
Ken Webb, Tony White
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 6 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
119
Voted
SAC
2005
ACM
15 years 7 months ago
Formal modeling and quantitative analysis of KLAIM-based mobile systems
KLAIM is an experimental language designed for modeling and programming distributed systems composed of mobile components where distribution awareness and dynamic system architect...
Rocco De Nicola, Diego Latella, Mieke Massink
158
Voted
INLG
2010
Springer
14 years 11 months ago
Complex Lexico-syntactic Reformulation of Sentences Using Typed Dependency Representations
We present a framework for reformulating sentences by applying transfer rules on a typed dependency representation. We specify a list of operations that the framework needs to sup...
Advaith Siddharthan
ACL
1993
15 years 3 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal