Sciweavers

350 search results - page 33 / 70
» Hardness Results for Homology Localization
Sort
View
DDECS
2006
IEEE
146views Hardware» more  DDECS 2006»
14 years 1 months ago
Automatic Identification of Timing Anomalies for Cycle-Accurate Worst-Case Execution Time Analysis
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
Jochen Eisinger, Ilia Polian, Bernd Becker, Alexan...
AI
2003
Springer
14 years 3 months ago
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...
Alena Shmygelska, Holger H. Hoos
CP
2006
Springer
14 years 1 months ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
EOR
2007
77views more  EOR 2007»
13 years 9 months ago
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
Jorge Maturana, María-Cristina Riff
TIP
2010
94views more  TIP 2010»
13 years 4 months ago
User-Friendly Interactive Image Segmentation Through Unified Combinatorial User Inputs
One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate t...
Wenxian Yang, Jianfei Cai, Jianmin Zheng, Jiebo Lu...