Sciweavers

48 search results - page 6 / 10
» Towards Average-Case Complexity Analysis of NP Optimization ...
Sort
View
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
DCOSS
2005
Springer
15 years 3 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
IPL
2008
80views more  IPL 2008»
14 years 9 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
PR
2008
129views more  PR 2008»
14 years 9 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
PPSN
2004
Springer
15 years 2 months ago
On the Importance of Information Speed in Structured Populations
A radius–based separation of selection and recombination spheres in diffusion model EAs is introduced, enabling a new taxonomy, oriented towards information flow analysis. It a...
Mike Preuss, Christian Lasarczyk