Sciweavers

205 search results - page 31 / 41
» Grid Graph Reachability Problems
Sort
View
PC
2007
118views Management» more  PC 2007»
13 years 9 months ago
Peer-to-peer systems for discovering resources in a dynamic grid
The convergence of the Grid and Peer-to-Peer (P2P) worlds has led to many solutions that try to efficiently solve the problem of resource discovery on Grids. Some of these solutio...
Moreno Marzolla, Matteo Mordacchini, Salvatore Orl...
DLOG
2009
13 years 7 months ago
Testing Provers on a Grid - Framework Description
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
Carlos Areces, Daniel Gorín, Alejandra Lore...
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
14 years 6 months ago
Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Lintao Zh...
LICS
2003
IEEE
14 years 3 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
14 years 1 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar