Sciweavers

150 search results - page 23 / 30
» New Bounds for Codes Identifying Vertices in Graphs
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
FOCS
1997
IEEE
14 years 25 days ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
PDP
2005
IEEE
14 years 2 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
ESORICS
2010
Springer
13 years 9 months ago
Secure Code Update for Embedded Devices via Proofs of Secure Erasure
Remote attestation is the process of verifying internal state of a remote embedded device. It is an important component of many security protocols and applications. Although previo...
Daniele Perito, Gene Tsudik
IPPS
2007
IEEE
14 years 2 months ago
Minimum number of wavelengths equals load in a DAG without internal cycle
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
Jean-Claude Bermond, Michel Cosnard