Sciweavers

4679 search results - page 518 / 936
» Modeling When Connections Are the Problem
Sort
View
SCHEDULING
2010
116views more  SCHEDULING 2010»
15 years 5 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff
SEAL
2010
Springer
15 years 5 months ago
Bayesian Reliability Analysis under Incomplete Information Using Evolutionary Algorithms
During engineering design, it is often difficult to quantify product reliability because of insufficient data or information for modeling the uncertainties. In such cases, one need...
Rupesh Kumar Srivastava, Kalyanmoy Deb
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 4 months ago
Optimal Auctions with Correlated Bidders are Easy
We consider the problem of designing a revenue-maximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there...
Shahar Dobzinski, Hu Fu, Robert Kleinberg
ICASSP
2011
IEEE
14 years 10 months ago
Smart grid monitoring for intrusion and fault detection with new locally optimum testing procedures
The vulnerability of smart grid systems is a growing concern. Signal detection theory is employed here to detect a change in the system. We employ a discrete-time linear state spa...
Qian He, Rick S. Blum
INFOCOM
2009
IEEE
16 years 1 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang