Sciweavers

6315 search results - page 375 / 1263
» Approximating Solution Structure
Sort
View
FOCS
2006
IEEE
16 years 27 days ago
On the Optimality of the Dimensionality Reduction Method
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Alexandr Andoni, Piotr Indyk, Mihai Patrascu
ACMICEC
2007
ACM
102views ECommerce» more  ACMICEC 2007»
15 years 11 months ago
Learning to trade with insider information
This paper introduces algorithms for learning how to trade using insider (superior) information in Kyle's model of financial markets. Prior results in finance theory relied o...
Sanmay Das
ATAL
2010
Springer
15 years 8 months ago
Laplacian-based consensus on spatial computers
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
Nelson Elhage, Jacob Beal
190
Voted
GECCO
2008
Springer
170views Optimization» more  GECCO 2008»
15 years 8 months ago
Evolving prediction weights using evolution strategy
The evolution strategy is one of the strongest evolutionary algorithms for optimizing real-value vectors. In this paper, we study how to use it for the evolution of prediction wei...
Trung Hau Tran, Cédric Sanza, Yves Duthen
ADHOC
2008
96views more  ADHOC 2008»
15 years 7 months ago
Network configuration for optimal utilization efficiency of wireless sensor networks
This paper addresses the problem of configuring wireless sensor networks (WSNs). Specifically, we seek answers to the following questions: how many sensors should be deployed, wha...
Yunxia Chen, Chen-Nee Chuah, Qing Zhao