Sciweavers

3267 search results - page 611 / 654
» Computational Models of Language Acquisition
Sort
View
CONCUR
2007
Springer
14 years 2 months ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
FROCOS
2007
Springer
14 years 2 months ago
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Beatriz Alarcón, Salvador Lucas
ICALP
2007
Springer
14 years 2 months ago
Checking and Spot-Checking the Correctness of Priority Queues
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
Matthew Chu, Sampath Kannan, Andrew McGregor
ILP
2007
Springer
14 years 2 months ago
Learning to Assign Degrees of Belief in Relational Domains
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
Frédéric Koriche
AICT
2006
IEEE
163views Communications» more  AICT 2006»
14 years 2 months ago
A Methodology for Searching Reusable Business Processes
Web Services are becoming the prominent paradigm for distributed computing and electronic businesses. This makes natural the extension of the concepts at the base of the workflow ...
Francesco Calabrese, Giovanni Di Dio, Anna Rita Fa...