Sciweavers

3433 search results - page 187 / 687
» Heuristics for a bidding problem
Sort
View
INFOCOM
2011
IEEE
14 years 10 months ago
A prior-free revenue maximizing auction for secondary spectrum access
—Dynamic spectrum allocation has proven promising for mitigating the spectrum scarcity problem. In this model, primary users lease chunks of under-utilized spectrum to secondary ...
Ajay Gopinathan, Zongpeng Li
ICDCS
2012
IEEE
13 years 9 months ago
Towards Optimal Capacity Segmentation with Hybrid Cloud Pricing
—Cloud resources are usually priced in multiple markets with different service guarantees. For example, Amazon EC2 prices virtual instances under three pricing schemes — the su...
Wei Wang, Baochun Li, Ben Liang
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 10 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
MP
2011
15 years 1 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
CP
2005
Springer
16 years 4 days ago
Lookahead Saturation with Restriction for SAT
We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report o...
Anbulagan, John K. Slaney