159 search results - page 16 / 32 » Generating Functions for Computing the Myerson Value |
ATMOS
2010
13 years 6 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...
GLVLSI
2009
IEEE
14 years 2 months ago
2009
IEEE
A synthetic noise function is a key component of most computer graphics rendering systems. This pseudo-random noise function is used to create a wide variety of natural looking te...
Presentation
In robotic navigation, path planning is aimed at getting the optimum collision-free
path between a starting and target locations. The optimality criterion depends on
the surround...
CGO
2004
IEEE
13 years 11 months ago
2004
IEEE
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...