Sciweavers

93 search results - page 16 / 19
» Should we worry about memory loss
Sort
View
AAAI
2012
11 years 11 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
CANPC
1998
Springer
14 years 23 days ago
The Remote Enqueue Operation on Networks of Workstations
Abstract. Modern networks of workstations connected by Gigabit networks have the ability to run high-performance computing applications at a reasonable performance, but at a signi ...
Evangelos P. Markatos, Manolis Katevenis, Penny Va...
COMCOM
2006
98views more  COMCOM 2006»
13 years 8 months ago
High-speed IP address lookup using balanced multi-way trees
Rapid growth of the Internet traffic requires more bandwidth and high-speed packet processing in the Internet routers. As one of the major packet processing performed in routers, ...
Hyesook Lim, Wonjung Kim, Bomi Lee, Changhoon Yim
OOPSLA
2010
Springer
13 years 6 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
13 years 10 months ago
Information fusion strategies from distributed filters in packet-drop networks
Abstract-- In this paper we study different distributed estimation schemes for stochastic discrete time linear systems where the communication between the sensors and the estimatio...
Alessandro Chiuso, Luca Schenato