Sciweavers

1220 search results - page 85 / 244
» Restricting grammatical complexity
Sort
View
AI
2006
Springer
13 years 11 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch
CIA
2006
Springer
13 years 11 months ago
Iterative Query-Based Approach to Efficient Task Decomposition and Resource Allocation
Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the t...
Michal Pechoucek, Ondrej Lerch, Jirí B&iacu...
FOSSACS
2006
Springer
13 years 11 months ago
Propositional Dynamic Logic with Recursive Programs
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
Christof Löding, Olivier Serre
ICSOFT
2008
13 years 9 months ago
An Architecture for Non Functional Properties Management in Distributed Computing
One of the primary benefits of Service Oriented Architecture (SOA) [1] is the ability to compose applications, processes or more complex services from other services. As the comple...
Pierre de Leusse, Panos Periorellis, Theodosis Dim...
EACL
2003
ACL Anthology
13 years 9 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä