Sciweavers

291 search results - page 33 / 59
» On Generalizing Pawlak Approximation Operators
Sort
View
91
Voted
AR
2007
117views more  AR 2007»
15 years 19 days ago
Feeling a rigid virtual world through an impulsive haptic display
—In this paper the first haptic display capable of applying a true impulse to the operator is presented. The applied impulse results in an immediate change of the user’s momen...
Emmanuel B. Vander Poorten, Yasuyoshi Yokokohji
79
Voted
PODC
2009
ACM
16 years 1 months ago
Max registers, counters, and monotone circuits
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
James Aspnes, Hagit Attiya, Keren Censor
85
Voted
IWMM
2007
Springer
110views Hardware» more  IWMM 2007»
15 years 6 months ago
Path: page access tracking to improve memory management
Traditionally, operating systems use a coarse approximation of memory accesses to implement memory management algorithms by monitoring page faults or scanning page table entries. ...
Reza Azimi, Livio Soares, Michael Stumm, Thomas Wa...
100
Voted
JSAC
2011
83views more  JSAC 2011»
14 years 3 months ago
Trading Rate for Balanced Queue Lengths for Network Delay Minimization
—We consider a communication channel with two transmitters and one receiver, with an underlying rate region which is approximated as a general pentagon. Different from the Gaussi...
Jing Yang, Sennur Ulukus
100
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Network Bandwidth Allocation via Distributed Auctions with Time Reservations
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
Pablo Belzarena, Andrés Ferragut, Fernando ...