35 search results - page 3 / 7 » ipl 2002 |
IPL
2002
13 years 4 months ago
2002
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices wh...
IPL
2002
13 years 4 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
IPL
2002
13 years 4 months ago
2002
We study the possibility of constructing decision trees with evolutionary algorithms in order to increase their predictive accuracy. We present a self-adapting evolutionary algori...
IPL
2002
13 years 4 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
IPL
2002
13 years 4 months ago
2002
We develop a formal semantics of sequence diagrams. The semantics is given in terms of our new temporal logic, named HDTL, which is designed to specify dynamically evolving system...