Sciweavers

14165 search results - page 292 / 2833
» The generalized two-server problem
Sort
View
CEC
2005
IEEE
15 years 8 months ago
Co-evolutionary modular neural networks for automatic problem decomposition
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
Vineet R. Khare, Xin Yao, Bernhard Sendhoff, Yaoch...
IJCAI
2007
15 years 8 months ago
Handling Alternative Activities in Resource-Constrained Project Scheduling Problems
In the context of operative disruption management, decision support systems have to evaluate the typically manifold options of responding to disturbances: The temporal shift of ac...
Jürgen Kuster, Dietmar Jannach, Gerhard Fried...
ICMAS
2000
15 years 8 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 7 months ago
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
15 years 7 months ago
Multi-objective memetic approach for flexible process sequencing problems
This paper describes a multi-objective memetic approach for solving multi-objective flexible process sequencing problems in flexible manufacturing systems (FMSs). FMS can be des...
Jian-Hong Chen, Jian-Hung Chen