2231 search results - page 426 / 447 » Alternation as a programming paradigm |
137
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
127
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
130
click to vote
MOBIHOC
2003
ACM
16 years 3 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
148
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
139
click to vote
EUROSYS
2006
ACM
16 years 1 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...