409 search results - page 37 / 82 » Evolutionary learning of small networks |
PDC
2004
ACM
15 years 5 months ago
2004
ACM
This paper describes and analyses the early developmental stages of a community learning network based in an urban community and social service agency. With government funding, th...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
112
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Stability of Wardrop equilibria is analyzed for dynamical transportation networks in which the drivers’ route choices are influenced by information at multiple temporal and spat...
107
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...