377 search results - page 30 / 76 » A Fast Heuristic Algorithm for a Probe Mapping Problem |
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
HEURISTICS
2008
13 years 8 months ago
2008
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
TON
2008
13 years 8 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
ICRA
2003
IEEE
14 years 2 months ago
2003
IEEE
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The continuous growth of the routing tables sizes in backbone routers is one of the most compelling scaling problems affecting the Internet and has originated considerab...