Sciweavers

4761 search results - page 653 / 953
» Performance of Protocols
Sort
View
AAAI
2000
15 years 6 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman
SERP
2003
15 years 6 months ago
Measures for Mobile Users
— Software measures are important to evaluate software properties like complexity, reusability, maintainability, effort required, etc. Collecting such data is difficult because o...
Alberto Sillitti, Andrea Janes, Giancarlo Succi, T...
SFP
2003
15 years 6 months ago
Implementing Mobile Haskell
Abstract: Mobile computation enables computations to move between a dynamic set of locations, and is becoming an increasingly important paradigm. mHaskell is an extension of Haskel...
André Rauber Du Bois, Philip W. Trinder, Ha...
AAAI
1997
15 years 6 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee
PSTV
1992
113views Hardware» more  PSTV 1992»
15 years 5 months ago
Coverage Preserving Reduction Strategies for Reachability Analysis
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...
Gerard J. Holzmann, Patrice Godefroid, Didier Piro...