Sciweavers

2212 search results - page 412 / 443
» Coordinating Open Distributed Systems
Sort
View
MOBICOM
2010
ACM
13 years 7 months ago
Privacy vulnerability of published anonymous mobility traces
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
CCS
2004
ACM
14 years 1 months ago
On the effectiveness of address-space randomization
Address-space randomization is a technique used to fortify systems against bu er over ow attacks. The idea is to introduce arti cial diversity by randomizing the memory location o...
Hovav Shacham, Matthew Page, Ben Pfaff, Eu-Jin Goh...
IOR
2008
113views more  IOR 2008»
13 years 7 months ago
Service Competition with General Queueing Facilities
In many service industries, companies compete with each other on the basis of the waiting time their customers experience, along with the price they charge for their service. A fi...
Gad Allon, Awi Federgruen
MOBIHOC
2009
ACM
14 years 8 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu
MSR
2006
ACM
14 years 1 months ago
Mining large software compilations over time: another perspective of software evolution
With the success of libre (free, open source) software, a new type of software compilation has become increasingly common. Such compilations, often referred to as ‘distributions...
Gregorio Robles, Jesús M. González-B...