5506 search results - page 1015 / 1102 » Minimal Logic Programs |
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
ISCA
2010
IEEE
14 years 29 days ago
2010
IEEE
Light-weight, flexible access control, which allows software to regulate reads and writes to any granularity of memory region, can help improve the reliability of today’s multi...
INFOCOM
2002
IEEE
14 years 24 days ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
INFOCOM
2002
IEEE
14 years 24 days ago
2002
IEEE
—This paper describes a novel framework, called Distributed Partial Information Management (or DPIM). It addresses several major challenges in achieving efficient shared path pr...
CPM
2000
Springer
14 years 7 days ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...