849 search results - page 143 / 170 » On the Complexity of the Whitehead Minimization Problem |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
SMA
2003
ACM
14 years 2 months ago
2003
ACM
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
SIROCCO
2010
13 years 10 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
CN
2002
13 years 9 months ago
2002
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
PVLDB
2010
13 years 7 months ago
2010
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...