335 search results - page 36 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
123
Voted
DAC
2001
ACM
16 years 4 months ago
2001
ACM
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
135
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
116
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
119
Voted
RSA
2010
15 years 1 months ago
2010
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
123
click to vote
VTC
2006
IEEE
15 years 9 months ago
2006
IEEE
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...