Sciweavers

2468 search results - page 88 / 494
» On Model Checking Techniques for Randomized Distributed Syst...
Sort
View
CP
2006
Springer
15 years 7 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
137
Voted
JSS
2008
122views more  JSS 2008»
15 years 1 months ago
Traffic-aware stress testing of distributed real-time systems based on UML models using genetic algorithms
This report presents a model-driven, stress test methodology aimed at increasing chances of discovering faults related to network traffic in Distributed Real-Time Systems (DRTS). T...
Vahid Garousi, Lionel C. Briand, Yvan Labiche
119
Voted
MIDDLEWARE
2004
Springer
15 years 8 months ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper
144
Voted
SBMF
2009
Springer
184views Formal Methods» more  SBMF 2009»
15 years 10 months ago
Concolic Testing of the Multi-sector Read Operation for Flash Memory File System
In today’s information society, flash memory has become a virtually indispensable component, particularly for mobile devices. In order for mobile devices to operate successfully...
Moonzoo Kim, Yunho Kim
EUROPAR
2004
Springer
15 years 8 months ago
Exploiting Spatial Store Locality Through Permission Caching in Software DSMs
Abstract. Fine-grained software-based distributed shared memory (SWDSM) systems typically maintain coherence with in-line checking code at load and store operations to shared memor...
Håkan Zeffer, Zoran Radovic, Oskar Grenholm,...