Sciweavers

205 search results - page 36 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
WSC
2004
13 years 10 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
WWW
2003
ACM
14 years 9 months ago
Efficient URL caching for world wide web crawling
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
Andrei Z. Broder, Marc Najork, Janet L. Wiener
EUROPAR
2007
Springer
14 years 2 months ago
On the Connectivity of Bluetooth-Based Ad Hoc Networks
We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other device...
Pilu Crescenzi, Carlo Nocentini, Andrea Pietracapr...
INFOCOM
2011
IEEE
12 years 12 months ago
Identity-based attack detection in mobile wireless networks
—Identity-based attacks (IBAs) are one of the most serious threats to wireless networks. Recently, received signal strength (RSS) based detection mechanisms were proposed to dete...
Kai Zeng, Kannan Govindan, Daniel Wu, Prasant Moha...
ACSAC
2010
IEEE
13 years 6 months ago
Porscha: policy oriented secure content handling in Android
The penetration of cellular networks worldwide and emergence of smart phones has led to a revolution in mobile content. Users consume diverse content when, for example, exchanging...
Machigar Ongtang, Kevin R. B. Butler, Patrick Drew...