Sciweavers

16843 search results - page 431 / 3369
» On Generalized Authorization Problems
Sort
View
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
CEC
2010
IEEE
15 years 7 months ago
Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
Liang Feng, Yew-Soon Ong, Quang Huy Nguyen 0001, A...
ALGORITHMICA
2007
89views more  ALGORITHMICA 2007»
15 years 7 months ago
The Complexity of the Single Individual SNP Haplotyping Problem
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...