Sciweavers

697 search results - page 28 / 140
» On the Theory of Average Case Complexity
Sort
View
PSD
2010
Springer
108views Database» more  PSD 2010»
13 years 6 months ago
Disclosure Risk of Synthetic Population Data with Application in the Case of EU-SILC
In survey statistics, simulation studies are usually performed by repeatedly drawing samples from population data. Furthermore, population data may be used in courses on survey sta...
Matthias Templ, Andreas Alfons
COCOA
2010
Springer
13 years 5 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
MOBIHOC
2003
ACM
14 years 7 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
HICSS
2005
IEEE
133views Biometrics» more  HICSS 2005»
14 years 1 months ago
Who Joins the Platform? The Case of the RFID Business Ecosystem
Today, many knowledge-based technology applications form a business ecosystem: a set of complex products and services made by multiple firms in which no firm is dominant. For this...
Anne Quaadgras
INFOCOM
2003
IEEE
14 years 1 months ago
Time-Optimal Network Queue Control: The Case of a Single Congested Node
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
Mahadevan Iyer, Wei Kang Tsai