Sciweavers

17329 search results - page 3068 / 3466
» Improved non-approximability results
Sort
View
201
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
Measuring Complexity and Predictability in Networks with Multiscale Entropy Analysis
—We propose to use multiscale entropy analysis in characterisation of network traffic and spectrum usage. We show that with such analysis one can quantify complexity and predict...
Janne Riihijärvi, Matthias Wellens, Petri M&a...
175
Voted
BPM
2009
Springer
195views Business» more  BPM 2009»
16 years 1 months ago
Process Mining: Fuzzy Clustering and Performance Visualization
The goal of performance analysis of business processes is to gain insights into operational processes, for the purpose of optimizing them. To intuitively show which parts of the pr...
Boudewijn F. van Dongen, A. Adriansyah
WINE
2009
Springer
202views Economy» more  WINE 2009»
16 years 1 months ago
A New Ranking Scheme of the GSP Mechanism with Markovian Users
Sponsored search auction is used by most search engines to select ads to display on the web page of a search result, according to advertisers’ bidding prices. The income of this ...
Xiaotie Deng, Jiajin Yu
ATAL
2009
Springer
16 years 1 months ago
Effective tag mechanisms for evolving cooperation
Certain observable features (tags), shared by a group of similar agents, can be used to signal intentions and can be effectively used to infer unobservable properties. Such infere...
Matthew Matlock, Sandip Sen
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
16 years 1 months ago
Fixed-Polynomial Size Circuit Bounds
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
Lance Fortnow, Rahul Santhanam, Ryan Williams
« Prev « First page 3068 / 3466 Last » Next »