364 search results - page 12 / 73 » A benchmark for the sorting network problem |
IJMC
2006
13 years 6 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
CEC
2009
IEEE
13 years 10 months ago
2009
IEEE
— 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...
IJCNN
2006
IEEE
14 years 22 days ago
2006
IEEE
— A method is presented for extending the Evolving Connectionist System (ECoS) algorithm that allows it to explicitly represent and learn nominal-scale data without the need for ...
JSAC
2006
13 years 6 months ago
2006
We use game theorectic models to show the lack of incentives in the TCP congestion avoidance algorithm and the consequential systemwide network problems. We then propose a Vickery-...
EUROGP
1999
Springer
13 years 11 months ago
1999
Springer
– This article presents a new approach to the evolution of controllers for autonomous agents. We propose the evolution of a connectionist structure where each node has an associa...