Sciweavers

461 search results - page 15 / 93
» Bounds for Validation
Sort
View
AAAI
2008
14 years 1 months ago
Limits and Possibilities of BDDs in State Space Search
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
Stefan Edelkamp, Peter Kissmann
ESA
2009
Springer
146views Algorithms» more  ESA 2009»
14 years 5 months ago
Kernel Bounds for Disjoint Cycles and Disjoint Paths
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
Hans L. Bodlaender, Stéphan Thomassé...
GLOBECOM
2008
IEEE
14 years 5 months ago
An Upper Bound on Network Size in Mobile Ad-Hoc Networks
—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...
ICPP
2006
IEEE
14 years 5 months ago
Achieving Bounded Delay on Message Delivery in Publish/Subscribe Systems
Publish/subscribe (pub/sub) systems are very suitable for the dissemination of dynamic information over the Internet. As dynamic information is usually characterized by a short li...
Jinling Wang, Jiannong Cao, Jing Li, Jie Wu
FORTE
2008
14 years 10 days ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...