Sciweavers

3678 search results - page 305 / 736
» On the Stable Paths Problem
Sort
View
INFOCOM
2003
IEEE
16 years 22 hour ago
Detecting Network Intrusions via Sampling: A Game Theoretic Approach
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...
Murali S. Kodialam, T. V. Lakshman
DAM
2000
126views more  DAM 2000»
15 years 6 months ago
2-Medians in trees with pos/neg weights
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...
Rainer E. Burkard, Eranda Çela, Helidon Dol...
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 1 months ago
Lower bound for deterministic semantic-incremental branching programs solving GEN
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
Dustin Wehr
IOR
2011
107views more  IOR 2011»
15 years 1 months ago
Information Collection on a Graph
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
Ilya O. Ryzhov, Warren B. Powell
ASPDAC
2011
ACM
157views Hardware» more  ASPDAC 2011»
14 years 10 months ago
Facilitating unreachable code diagnosis and debugging
— 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...
Hong-Zu Chou, Kai-Hui Chang, Sy-Yen Kuo