Sciweavers

110 search results - page 13 / 22
» Solving a Practical Examination Timetabling Problem: A Case ...
Sort
View
RECOMB
2005
Springer
14 years 8 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
CEC
2009
IEEE
14 years 2 months ago
Differential Evolution with Laplace mutation operator
— Differential Evolution (DE) is a novel evolutionary approach capable of handling non-differentiable, non-linear and multi-modal objective functions. DE has been consistently ra...
Millie Pant, Radha Thangaraj, Ajith Abraham, Crina...
ICAC
2007
IEEE
14 years 2 months ago
Approximation Modeling for the Online Performance Management of Distributed Computing Systems
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...
Dara Kusic, Nagarajan Kandasamy, Guofei Jiang
INFOCOM
2005
IEEE
14 years 1 months ago
Optimizing cost-sensitive trust-negotiation protocols
Trust negotiation is a process that establishes mutual trust by the exchange of digital credentials and/or guiding policies among entities who may have no pre-existing knowledge a...
Weifeng Chen, L. Clarke, James F. Kurose, Donald F...
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
13 years 11 months ago
Multi-step environment learning classifier systems applied to hyper-heuristics
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
Javier G. Marín-Blázquez, Sonia Schu...