Sciweavers

150 search results - page 9 / 30
» A Calculus for Relaxed Memory
Sort
View
MP
2002
85views more  MP 2002»
14 years 10 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
GLOBECOM
2006
IEEE
15 years 4 months ago
A Network Calculus Approach to Probabilistic Quality of Service Analysis of Fading Channels
Abstract— Network calculus is an established theory for deterministic quality of service analysis of fixed networks. Due to the failures inherent in fading channels it is, howev...
Markus Fidler
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 5 months ago
The Impact of Memory Models on Software Reliability in Multiprocessors
The memory consistency model is a fundamental system property characterizing a multiprocessor. The relative merits of strict versus relaxed memory models have been widely debated ...
Alexander Jaffe, Thomas Moscibroda, Laura Effinger...
98
Voted
SEMWEB
2005
Springer
15 years 4 months ago
Discovery and Uncertainty in Semantic Web Services
Although Semantic Web service discovery has been extensively studied in the literature ([7], [12], [15] and [10]), we are far from achieving an effective, complete and automated di...
Francisco Martín-Recuerda, Dave Robertson
BPM
2006
Springer
104views Business» more  BPM 2006»
15 years 2 months ago
Investigations on Soundness Regarding Lazy Activities
Current approaches for proving the correctness of business processes focus on either soundness, weak soundness, or relaxed soundness. Soundness states that each activity should be ...
Frank Puhlmann, Mathias Weske