438 search results - page 8 / 88 » On Perfect Switching Classes |
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...
DM
2002
13 years 7 months ago
2002
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority ga...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Most common network protocols (e.g., the Internet Protocol) work with variable size packets, whereas contemporary switches still operate with fixed size cells, which are easier t...