Sciweavers

5015 search results - page 218 / 1003
» Model Checking a Path
Sort
View
CMOT
2000
123views more  CMOT 2000»
15 years 6 months ago
Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models
A variety of different multi-agent (competitive) network models have been described in the literature. Computational techniques for solving such models often involve the iterative...
Steven A. Gabriel, David Bernstein
AIPS
2010
15 years 7 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
HICSS
2007
IEEE
137views Biometrics» more  HICSS 2007»
16 years 22 days ago
Value Driven Security Threat Modeling Based on Attack Path Analysis
This paper presents a quantitative threat modeling method, the Threat Modeling method based on Attack Path Analysis (T-MAP), which quantifies security threats by calculating the t...
Yue Chen, Barry W. Boehm, Luke Sheppard
VTC
2006
IEEE
273views Communications» more  VTC 2006»
16 years 12 days ago
Path Loss Models for Air-to-Ground Radio Channels in Urban Environments
Abstract—This paper provides new statistical models for air-toground channels in an urban environment. The model is derived to operate at frequencies from 200MHz to 5GHz. Issues ...
Qixing Feng, Joe McGeehan, Eustace K. Tameh, Andre...
LPNMR
2004
Springer
15 years 11 months ago
Towards Automated Integration of Guess and Check Programs in Answer Set Programming
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...
Thomas Eiter, Axel Polleres