Sciweavers

1816 search results - page 40 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
EOR
2010
104views more  EOR 2010»
14 years 9 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
PRICAI
2004
Springer
15 years 5 months ago
A New Collaborative Recommender System Addressing Three Problems
Abstract. With the development of e-commerce and information access, a large amount of information can be found online, which makes a good recommendation service to be urgently nec...
Byeong Man Kim, Qing Li, Jong-Wan Kim, Jinsoo Kim
IJON
2006
134views more  IJON 2006»
14 years 11 months ago
A new approach to fuzzy classifier systems and its application in self-generating neuro-fuzzy systems
A classifier system is a machine learning system that learns syntactically simple string rules (called classifiers) through a genetic algorithm to guide its performance in an arbi...
Mu-Chun Su, Chien-Hsing Chou, Eugene Lai, Jonathan...
JMLR
2006
89views more  JMLR 2006»
14 years 11 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
15 years 6 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro