335 search results - page 32 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
135
Voted
IMC
2009
ACM
15 years 10 months ago
2009
ACM
Replicating content across a geographically distributed set of servers and redirecting clients to the closest server in terms of latency has emerged as a common paradigm for impro...
102
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
124
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
161
Voted
IEEEMSP
2002
IEEE
15 years 8 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
117
Voted
AIPS
2009
15 years 4 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...