Sciweavers

5595 search results - page 411 / 1119
» Comparing Subsumption Optimizations
Sort
View
CP
2005
Springer
16 years 11 days ago
On Solving Soft Temporal Constraints Using SAT Techniques
In this paper, we present an algorithm for finding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’...
Hossein M. Sheini, Bart Peintner, Karem A. Sakalla...
195
Voted
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
16 years 11 days ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
EMO
2005
Springer
110views Optimization» more  EMO 2005»
16 years 11 days ago
Parallelization of Multi-objective Evolutionary Algorithms Using Clustering Algorithms
Abstract. While Single-Objective Evolutionary Algorithms (EAs) parallelization schemes are both well established and easy to implement, this is not the case for Multi-Objective Evo...
Felix Streichert, Holger Ulmer, Andreas Zell
EPIA
2005
Springer
16 years 11 days ago
Improving Passage Retrieval in Question Answering Using NLP
Abstract. This paper describes an approach for the integration of linguistic information in passage retrieval in an open-source question answering system for Dutch. Annotation prod...
Jörg Tiedemann
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
16 years 11 days ago
Measuring mobility and the performance of global search algorithms
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
Monte Lunacek, L. Darrell Whitley, James N. Knight