1300 search results - page 180 / 260 » Probabilistic logic with independence |
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— This paper presents Meld, a programming language for modular robots, i.e., for independently executing robots where inter-robot communication is limited to immediate ne...
LCPC
2009
Springer
14 years 8 days ago
2009
Springer
PC grids represent massive computation capacity at a low cost, but are challenging to employ for parallel computing because of variable and unpredictable performance and availabili...
SIGSOFT
1998
ACM
13 years 12 months ago
1998
ACM
Implicit invocation SN92, GN91] has become an important architectural style for large-scale system design and evolution. This paper addresses the lack of speci cation and veri cat...
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
1 The low throughput at IC (Integrated Circuit) testing is mainly due to the increasing test data volume, which leads to high ATE (Automatic Test Equipment) memory requirements and...