1254 search results - page 108 / 251 » Making Hard Problems Harder |
121
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The success of a genetic programming system in solving a problem is often a function of the available computational resources. For many problems, the larger the population size an...
137
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
147
Voted
DOCENG
2006
ACM
15 years 9 months ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
134
Voted
PODC
2005
ACM
15 years 9 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
148
click to vote
MOBICOM
2003
ACM
15 years 9 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...