697 search results - page 4 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
CL
2012
Springer
11 years 10 months ago
2012
Springer
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
IPMU
2010
Springer
13 years 9 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
ICCSA
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabli...
CGI
1999
IEEE
13 years 12 months ago
1999
IEEE
This paper focuses on an approach to modeling shapes through the use of evolutionary optimization or genetic algorithms for functionally represented geometric objects. This repres...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...