370 search results - page 45 / 74 » Bounded modified realizability |
INFOCOM
1998
IEEE
14 years 27 days ago
1998
IEEE
The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possibl...
DAGSTUHL
2004
13 years 10 months ago
2004
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...
DNA
2006
Springer
14 years 10 days ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
COMGEO
2007
ACM
13 years 8 months ago
2007
ACM
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
EDBT
2009
ACM
14 years 16 days ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...