Sciweavers

6455 search results - page 50 / 1291
» Research problems
Sort
View
ICIC
2007
Springer
14 years 4 months ago
A Hybrid Electromagnetism-Like Algorithm for Single Machine Scheduling Problem
Electromagnetism-like algorithm (EM) is a population-based meta-heuristic which has been proposed to solve continuous problems effectively. In this paper, we present a new meta-h...
Shih-Hsin Chen, Pei-Chann Chang, Chien-Lung Chan, ...
CEC
2009
IEEE
14 years 4 months ago
Constructing test problems for bilevel evolutionary multi-objective optimization
— Many real-world problems demand a feasible solution to satisfy physical equilibrium, stability, or certain properties which require an additional lower level optimization probl...
Kalyanmoy Deb, Ankur Sinha
AIPS
2006
13 years 11 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
CPAIOR
2010
Springer
14 years 2 months ago
A Constraint Programming Approach for the Service Consolidation Problem
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
Kanika Dhyani, Stefano Gualandi, Paolo Cremonesi
STACS
2010
Springer
14 years 5 months ago
Reflections on Multivariate Algorithmics and Problem Parameterization
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
Rolf Niedermeier