Sciweavers

58 search results - page 1 / 12
» Competitive Freshness Algorithms for Wait-Free Data Objects
Sort
View
EUROPAR
2006
Springer
13 years 9 months ago
Competitive Freshness Algorithms for Wait-Free Data Objects
Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas
SPAA
1990
ACM
13 years 9 months ago
Wait-Free Data Structures in the Asynchronous PRAM Model
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
James Aspnes, Maurice Herlihy
ECRTS
2003
IEEE
13 years 11 months ago
Error-Driven QoS Management in Imprecise Real-Time Databases
In applications such as web-applications, e-commerce, and engine control, the demand for real-time data services has increased. In these applications, requests have to be processe...
Mehdi Amirijoo, Jörgen Hansson, Sang Hyuk Son
ESA
1999
Springer
105views Algorithms» more  ESA 1999»
13 years 10 months ago
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
Friedhelm Meyer auf der Heide, Berthold Vöcki...
KSEM
2009
Springer
14 years 9 days ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer