Sciweavers

458 search results - page 64 / 92
» Totally magic graphs
Sort
View
IPPS
2002
IEEE
14 years 17 days ago
Reliable Communication in Faulty Star Networks
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
Khaled Day, Abdel Elah Al-Ayyoub
STOC
1998
ACM
125views Algorithms» more  STOC 1998»
13 years 12 months ago
Spot-Checkers
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
Funda Ergün, Sampath Kannan, Ravi Kumar, Roni...
ICGA
1993
296views Optimization» more  ICGA 1993»
13 years 9 months ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier
ECRTS
2010
IEEE
13 years 8 months ago
Partitioning Parallel Applications on Multiprocessor Reservations
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...
Giorgio C. Buttazzo, Enrico Bini, Yifan Wu
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 7 months ago
Random Topologies and the emergence of cooperation: the role of short-cuts
We present a detailed study about the role of the short-cuts of a network in promoting the emergence of cooperation in a population of agents playing the Prisoner's Dilemma Ga...
Daniele Vilone, Angel Sánchez, Jesús...