335 search results - page 20 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
ICOIN
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
CCCG
1996
13 years 8 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...
COMPGEOM
1990
ACM
13 years 11 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
SIAMJO
2002
13 years 7 months ago
2002
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...