Sciweavers

229 search results - page 30 / 46
» A General Name Binding Mechanism
Sort
View
CODASPY
2012
12 years 5 months ago
Identifying native applications with high assurance
Main stream operating system kernels lack a strong and reliable mechanism for identifying the running processes and binding them to the corresponding executable applications. In t...
Hussain M. J. Almohri, Danfeng (Daphne) Yao, Denni...
INFOCOM
2008
IEEE
14 years 4 months ago
How Many Packets Can We Encode? - An Analysis of Practical Wireless Network Coding
— While the practical coding scheme [1] has been shown to be able to improve throughput of wireless networks, there still lacks fundamental understanding on how the coding scheme...
Jilin Le, John C. S. Lui, Dah-Ming Chiu
EDBT
2009
ACM
164views Database» more  EDBT 2009»
14 years 2 months ago
Fast object search on road networks
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
JAIR
2008
157views more  JAIR 2008»
13 years 9 months ago
Learning to Reach Agreement in a Continuous Ultimatum Game
It is well-known that acting in an individually rational manner, according to the principles of classical game theory, may lead to sub-optimal solutions in a class of problems nam...
Steven de Jong, Simon Uyttendaele, Karl Tuyls
LICS
2009
IEEE
14 years 4 months ago
Psi-calculi: Mobile Processes, Nominal Data, and Logic
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...