Sciweavers

707 search results - page 83 / 142
» A Practical Method for Quickly Evaluating Program Optimizati...
Sort
View
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 3 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
INFOCOM
2010
IEEE
13 years 7 months ago
Minimizing Electricity Cost: Optimization of Distributed Internet Data Centers in a Multi-Electricity-Market Environment
—The study of Cyber-Physical System (CPS) has been an active area of research. Internet Data Center (IDC) is an important emerging Cyber-Physical System. As the demand on Interne...
Lei Rao, Xue Liu, Le Xie, Wenyu Liu
AIPS
2010
13 years 11 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
LION
2009
Springer
135views Optimization» more  LION 2009»
14 years 3 months ago
Neural Network Pairwise Interaction Fields for Protein Model Quality Assessment
We present a new knowledge-based Model Quality Assessment Program (MQAP) at the residue level which evaluates single protein structure models. We use a tree representation of the ...
Alberto J. M. Martin, Alessandro Vullo, Gianluca P...
SIAMJO
2010
127views more  SIAMJO 2010»
13 years 3 months ago
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefini...
Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye