Sciweavers

3208 search results - page 530 / 642
» A Lower Bound for Primality
Sort
View
FLAIRS
2006
13 years 11 months ago
Some Second Order Effects on Interval Based Probabilities
In real-life decision analysis, the probabilities and values of consequences are in general vague and imprecise. One way to model imprecise probabilities is to represent a probabi...
David Sundgren, Mats Danielson, Love Ekenberg
DICTA
2003
13 years 11 months ago
Maximum-Likelihood Circle-Parameter Estimation via Convolution
In this paper, we present an interpretation of the Maximum Likelihood Estimator (MLE) and the Delogne-K˚asa Estimator (DKE) for circle-parameter estimation via convolution. Under ...
Emanuel Zelniker, Vaughan Clarkson
IJCAI
2001
13 years 11 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
NETWORKING
2004
13 years 11 months ago
Traffic Grooming in WDM Ring Networks with the Min-Max Objective
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
Bensong Chen, George N. Rouskas, Rudra Dutta
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 11 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin