1941 search results - page 76 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
159
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
153
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
In the paper, a formulation is proposed for optimal experiment design dedicated to the identification of nonlinear systems. In particular, a recently mentioned redundancy property ...
184
click to vote
DSN
2005
IEEE
15 years 11 months ago
2005
IEEE
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
175
click to vote
JCT
2006
15 years 6 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
156
click to vote
IWQOS
2004
Springer
15 years 11 months ago
2004
Springer
— The Internet still lacks adequate support for QoS applications with real-time requirements. In great part, this is due to the fact that provisioning of end-to-end QoS to trafï¬...