Sciweavers

2899 search results - page 1 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
JC
2002
63views more  JC 2002»
13 years 5 months ago
On the Complexity of Exclusion Algorithms for Optimization
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
Eugene L. Allgower, Melissa Erdmann, Kurt Georg
TRIDENTCOM
2006
IEEE
13 years 11 months ago
A reliable optimization on distributed mutual exclusion algorithm
– This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure...
Moharram Challenger, Peyman Bayat, Mohammad Reza M...
DC
2007
13 years 5 months ago
Adaptive mutual exclusion with local spinning
We present an adaptive algorithm for N-process mutual exclusion under read/write atomicity in which all busy waiting is by local spinning. In our algorithm, each process p perform...
Yong-Jik Kim, James H. Anderson
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 7 months ago
DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation
This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline quer...
Ping Wu, Divyakant Agrawal, Ömer Egecioglu, A...
DC
2010
13 years 22 days ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
Robert Danek, Wojciech M. Golab