Sciweavers

8413 search results - page 1567 / 1683
» Ordering Problem Subgoals
Sort
View
ATAL
2007
Springer
16 years 16 days ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
16 years 16 days ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
CCS
2007
ACM
16 years 16 days ago
Defining categories to select representative attack test-cases
To ameliorate the quality of protection provided by intrusion detection systems (IDS) we strongly need more effective evaluation and testing procedures. Evaluating an IDS against ...
Mohammed S. Gadelrab, Anas Abou El Kalam, Yves Des...
CIKM
2007
Springer
16 years 16 days ago
Ontology module extraction for ontology reuse: an ontology engineering perspective
Problems resulting from the management of shared, distributed knowledge has led to ontologies being employed as a solution, in order to effectively integrate information across a...
Paul Doran, Valentina A. M. Tamma, Luigi Iannone
CIKM
2007
Springer
16 years 16 days ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
« Prev « First page 1567 / 1683 Last » Next »