Sciweavers

6562 search results - page 200 / 1313
» Noetherianity and Combination Problems
Sort
View
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 10 months ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
ICANNGA
2007
Springer
112views Algorithms» more  ICANNGA 2007»
16 years 20 days ago
Multiple Sequence Alignment with Evolutionary-Progressive Method
A new evolutionary-progressive method for Multiple Sequence Alignment problem is proposed. The method efficiently combines flexibility of evolutionary approach with speed and accu...
Pawel Kupis, Jacek Mandziuk
SAFECOMP
2001
Springer
15 years 11 months ago
Project Experience with IEC 61508 and Its Consequences
The paper reports on the experiences with implementation of IEC 61508 in recent projects with European, North American and Japanese system vendors. The paper describes problems id...
Rainer Faller
AAAI
1998
15 years 7 months ago
Machine Learning of Generic and User-Focused Summarization
A key problem in text summarization is finding a salience function which determines what information in the source should be included in the summary. This paper describes the use ...
Inderjeet Mani, Eric Bloedorn
DCC
2002
IEEE
15 years 6 months ago
Bounds on the Covering Radius of Linear Codes
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
Alexei E. Ashikhmin, Alexander Barg