Sciweavers

1110 search results - page 24 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
15 years 3 months ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola
MP
1998
109views more  MP 1998»
14 years 11 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
CSCLP
2004
Springer
15 years 4 months ago
Characterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
Venkata Praveen Guddeti, Berthe Y. Choueiry
TWC
2008
238views more  TWC 2008»
14 years 11 months ago
Downlink resource allocation in multi-carrier systems: frequency-selective vs. equal power allocation
In this paper, a dynamic subcarrier and power allocation problem is considered in the context of asymptotic utility maximization in multi-carrier systems. Using the gradient-based...
Hyang-Won Lee, Song Chong
BMCBI
2004
94views more  BMCBI 2004»
14 years 11 months ago
The tissue microarray data exchange specification: implementation by the Cooperative Prostate Cancer Tissue Resource
Background: Tissue Microarrays (TMAs) have emerged as a powerful tool for examining the distribution of marker molecules in hundreds of different tissues displayed on a single sli...
Jules J. Berman, Milton Datta, Andre Kajdacsy-Ball...