Sciweavers

598 search results - page 87 / 120
» Efficient and User-Friendly Verification
Sort
View
WICON
2008
14 years 4 days ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
AAAI
2006
14 years 4 days ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
C3S2E
2010
ACM
13 years 12 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
CONCUR
2010
Springer
13 years 12 months ago
Buffered Communication Analysis in Distributed Multiparty Sessions
Many communication-centred systems today rely on asynchronous messaging among distributed peers to make efficient use of parallel execution and resource access. With such asynchron...
Pierre-Malo Deniélou, Nobuko Yoshida
CSIE
2009
IEEE
13 years 12 months ago
On Test Script Technique Oriented Automation of Embedded Software Simulation Testing
Succinct test script with high efficiency is one of key point for automation of embedded software testing. In this paper, we integrated object technique with automated simulation ...
Yongfeng Yin, Bin Liu, Bentao Zheng