Sciweavers

3038 search results - page 422 / 608
» High-Speed Function Approximation
Sort
View
194
Voted
ICALP
2010
Springer
15 years 11 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
BIRD
2008
Springer
109views Bioinformatics» more  BIRD 2008»
15 years 8 months ago
A Robust Class of Stable Proteins in the 2D HPC Model
The inverse protein folding problem is that of designing an amino acid sequence which has a prescribed native protein fold. This problem arises in drug design where a particular st...
Alireza Hadj Khodabakhshi, Ján Manuch, Aras...
COR
2008
122views more  COR 2008»
15 years 6 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
COMCOM
2006
168views more  COMCOM 2006»
15 years 6 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen
BMCBI
2005
84views more  BMCBI 2005»
15 years 6 months ago
A note on generalized Genome Scan Meta-Analysis statistics
Background: Wise et al. introduced a rank-based statistical technique for meta-analysis of genome scans, the Genome Scan Meta-Analysis (GSMA) method. Levinson et al. recently desc...
James A. Koziol, Anne C. Feng