302 search results - page 27 / 61 » Efficient Algorithms for the Longest Path Problem |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In wireless channels, the path loss exponent (PLE) has a strong impact on the quality of the links, and hence, it needs to be accurately estimated for the efficient design and oper...
CCCG
1996
13 years 10 months ago
1996
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
DATE
2006
IEEE
14 years 8 days ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
AIPS
2006
13 years 10 months ago
2006
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
EMSOFT
2006
Springer
14 years 8 days ago
2006
Springer
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...