Sciweavers

467 search results - page 23 / 94
» Roadmap of Infinite Results
Sort
View
ACL
2009
13 years 5 months ago
Incremental Parsing with Monotonic Adjoining Operation
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...
Yoshihide Kato, Shigeki Matsubara
EUROPAR
2006
Springer
13 years 11 months ago
Multicost Routing over an Infinite Time Horizon in Energy and Capacity Constrained Wireless Ad-Hoc Networks
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 7 months ago
Model Checking Synchronized Products of Infinite Transition Systems
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...
Stefan Wöhrle, Wolfgang Thomas
ITA
2007
153views Communications» more  ITA 2007»
13 years 7 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
MST
2006
129views more  MST 2006»
13 years 7 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding