Sciweavers

1032 search results - page 29 / 207
» Extended Computation Tree Logic
Sort
View
EJC
2010
14 years 9 months ago
The shape of unlabeled rooted random trees
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to th...
Michael Drmota, Bernhard Gittenberger
WWW
2004
ACM
15 years 10 months ago
Edgecomputing: extending enterprise applications to the edge of the internet
Content delivery networks have evolved beyond traditional distributed caching. With services such as Akamai's EdgeComputing it is now possible to deploy and run enterprise bu...
Andy Davis, Jay Parikh, William E. Weihl
COLING
1996
14 years 11 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
ATAL
1997
Springer
15 years 1 months ago
A Deliberative and Reactive Diagnosis Agent Based on Logic Programming
We briefly overview the architecture of a diagnosis agent. We employ logic and logic programming to specify and implement the agent: the knowledge base uses extended logic progra...
Michael Schroeder, Iara de Almeida Móra, Lu...
GG
2004
Springer
15 years 3 months ago
Extending Graph Rewriting for Refactoring
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
Niels Van Eetvelde, Dirk Janssens