Sciweavers

1204 search results - page 123 / 241
» Termination of Polynomial Programs
Sort
View
93
Voted
APLAS
2007
ACM
15 years 4 months ago
Timed, Distributed, Probabilistic, Typed Processes
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
Martin Berger, Nobuko Yoshida
91
Voted
ICLP
2010
Springer
15 years 4 months ago
Learning Domain-Specific Heuristics for Answer Set Solvers
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
Marcello Balduccini
69
Voted
GPCE
2007
Springer
15 years 4 months ago
Context-aware scanning for parsing extensible languages
This paper introduces new parsing and context-aware scanning algorithms in which the scanner uses contextual information to disambiguate lexical syntax. The parser uses a slightly...
Eric Van Wyk, August Schwerdfeger
99
Voted
ESOP
2009
Springer
15 years 4 months ago
Verified, Executable Parsing
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
Aditi Barthwal, Michael Norrish
87
Voted
IFIP
2000
Springer
15 years 4 months ago
A Performance Analysis of IEEE 802.11 Networks in the Presence of Hidden Stations
: IEEE 802.11 is a wireless network standard that was completed in 1997. Unfortunately, the medium access protocol described in the standard meets some problems that arise from the...
Marek Natkaniec, Andrzej R. Pach