2796 search results - page 153 / 560 » The coolest path problem |
168
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we consider the problem of detecting an intruding packet in a communication network. Detection is accomplished by sampling a portion of the packets transiting selec...
128
click to vote
DAM
2000
15 years 5 months ago
2000
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
185
click to vote
ASPDAC
2011
ACM
14 years 9 months ago
2011
ACM
— Code coverage is a popular method to find design bugs and verification loopholes. However, once a piece of code is determined to be unreachable, diagnosing the cause of the p...
170
click to vote
FUN
2007
Springer
15 years 10 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
157
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...