Sciweavers

920 search results - page 141 / 184
» Generating Satisfiable Problem Instances
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
TRIDENTCOM
2008
IEEE
14 years 2 months ago
A case study in testing a network security algorithm
Several difficulties arise when testing network security algorithms. First, using network data captured at a router does not guarantee that any instances of the security event of...
Carrie Gates
EUROMICRO
2007
IEEE
14 years 2 months ago
Partial Verification of Software Components: Heuristics for Environment Construction
Code model checking of software components suffers from the well-known problem of state explosion when applied to highly parallel components, despite the fact that a single compon...
Pavel Parizek, Frantisek Plasil
OTM
2007
Springer
14 years 1 months ago
Discovering Executable Semantic Mappings Between Ontologies
Creating executable semantic mappings is an important task for ontology-based information integration. Although it is argued that mapping tools may require interaction from humans ...
Han Qin, Dejing Dou, Paea LePendu
MICRO
2006
IEEE
132views Hardware» more  MICRO 2006»
14 years 1 months ago
Data-Dependency Graph Transformations for Superblock Scheduling
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
Mark Heffernan, Kent D. Wilken, Ghassan Shobaki