465 search results - page 22 / 93 » On the Hardness of Range Assignment Problems |
AI
2003
Springer
15 years 5 months ago
2003
Springer
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...
186
click to vote
LSSC
2007
Springer
15 years 6 months ago
2007
Springer
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
105
click to vote
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
SOFSEM
2007
Springer
15 years 6 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
122
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...