Sciweavers

1964 search results - page 216 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
DAWAK
2006
Springer
13 years 12 months ago
Mining Direct Marketing Data by Ensembles of Weak Learners and Rough Set Methods
This paper describes problem of prediction that is based on direct marketing data coming from Nationwide Products and Services Questionnaire (NPSQ) prepared by Polish division of A...
Jerzy Blaszczynski, Krzysztof Dembczynski, Wojciec...
4OR
2008
96views more  4OR 2008»
13 years 8 months ago
A column generation approach to train timetabling on a corridor
We propose heuristic and exact algorithms for the (periodic and non-periodic) train timetabling problem on a corridor that are based on the solution of the LP relaxation of an ILP...
Valentina Cacchiani, Alberto Caprara, Paolo Toth
TEC
2002
183views more  TEC 2002»
13 years 7 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
ICIW
2009
IEEE
14 years 2 months ago
Paircoding: Improving File Sharing Using Sparse Network Codes
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
Christian Ortolf, Christian Schindelhauer, Arne Va...
CEC
2010
IEEE
13 years 9 months ago
Coordinate System Archive for coevolution
Problems in which some entities interact with each other are common in computational intelligence. This scenario, typical for co-evolving artificial-life agents, learning strategie...
Wojciech Jaskowski, Krzysztof Krawiec