Sciweavers

9284 search results - page 488 / 1857
» Knowledge State Algorithms
Sort
View
CAEPIA
2007
Springer
15 years 11 months ago
Efficient Pruning of Operators in Planning Domains
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
Anders Jonsson
ENTCS
2006
112views more  ENTCS 2006»
15 years 7 months ago
Distributed Symbolic Bounded Property Checking
In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifie...
Pradeep Kumar Nalla, Roland J. Weiss, Prakash Moha...
IJCOMSYS
2008
79views more  IJCOMSYS 2008»
15 years 7 months ago
An efficient admission control for IEEE 802.11 networks based on throughput analyses of (un)saturated channel
This paper presents a novel analytical model and an efficient admission control algorithm for IEEE 802.11 DCF access mechanism. In contrast to the previous approaches that only ana...
Lidong Lin, Haohuan Fu, Weijia Jia
IJRR
2008
67views more  IJRR 2008»
15 years 7 months ago
Sampling-based Falsification and Verification of Controllers for Continuous Dynamic Systems
: In this paper, we present a sampling-based verification algorithm for continuous dynamic systems with uncertainty due to adversaries, unmodeled disturbance inputs, unknown parame...
Peng Cheng, Vijay Kumar
RP
2010
Springer
118views Control Systems» more  RP 2010»
15 years 5 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa