Sciweavers

14518 search results - page 233 / 2904
» Two Problems for Sophistication
Sort
View
97
Voted
ATAL
2006
Springer
15 years 4 months ago
An agent based general solution model for the course timetabling problem
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...
Yan Yang, Raman Paranjape, Luigi Benedicenti
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 4 months ago
Dominance learning in diploid genetic algorithms for dynamic optimization problems
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
Shengxiang Yang
104
Voted
NAA
2000
Springer
104views Mathematics» more  NAA 2000»
15 years 4 months ago
A Grid Free Monte Carlo Algorithm for Solving Elliptic Boundary Value Problems
In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ba...
Todor V. Gurov, Paula A. Whitlock, Ivan Dimov
103
Voted
SPDP
1991
IEEE
15 years 4 months ago
Parallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
Ying Zhang, Alan K. Mackworth
CEC
2009
IEEE
15 years 4 months ago
A simple multi-objective optimization algorithm for the urban transit routing problem
— The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NPHard, high...
Lang Fan, Christine L. Mumford, Dafydd Evans