13214 search results - page 2401 / 2643 » Pseudorandomness for network algorithms |
151
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Expertise retrieval has received increased interests in recent years, whose task is to suggest people with relevant expertise. Motivated by the observation that communities could ...
173
click to vote
COCOA
2009
Springer
16 years 1 months ago
2009
Springer
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
177
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Helicopter hovering is an important challenge problem in the field of reinforcement learning. This paper considers several neuroevolutionary approaches to discovering robust cont...
219
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
168
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
Induced (chord-free) cycles in binary hypercubes have many applications in computer science. The state of the art for computing such cycles relies on genetic algorithms, which are,...