Sciweavers

692 search results - page 45 / 139
» Why Experimentation can be better than
Sort
View
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
15 years 5 months ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
ATAL
2008
Springer
15 years 3 months ago
Reaction functions for task allocation to cooperative agents
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routi...
Xiaoming Zheng, Sven Koenig
CDES
2007
82views Hardware» more  CDES 2007»
15 years 3 months ago
Efficient Global Fault Collapsing for Combinational Library Modules
—Fault collapsing is the process of reducing the number of faults by using redundance and equivalence/dominance relationships among faults. Exact global fault collapsing can be e...
Hussain Al-Asaad
IJCAI
2007
15 years 3 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
ACL
2006
15 years 2 months ago
A Hybrid Convolution Tree Kernel for Semantic Role Labeling
A hybrid convolution tree kernel is proposed in this paper to effectively model syntactic structures for semantic role labeling (SRL). The hybrid kernel consists of two individual...
Wanxiang Che, Min Zhang, Ting Liu, Sheng Li