Sciweavers

1736 search results - page 272 / 348
» On antimagic directed graphs
Sort
View
JSAC
2008
98views more  JSAC 2008»
14 years 12 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
SIAMDM
2008
77views more  SIAMDM 2008»
14 years 11 months ago
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
Angel Corberán, Isaac Plana, José M....
TVCG
2008
140views more  TVCG 2008»
14 years 11 months ago
Efficient Morse Decompositions of Vector Fields
Vector field analysis plays a crucial role in many engineering applications, such as weather prediction, tsunami and hurricane study, and airplane and automotive design. Existing ...
Guoning Chen, Konstantin Mischaikow, Robert S. Lar...
MST
2002
152views more  MST 2002»
14 years 11 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
ESWA
2008
166views more  ESWA 2008»
14 years 11 months ago
Modular design to support green life-cycle engineering
The severe competition in the market has driven enterprises to produce a wider variety of products to meet consumers' needs. However, frequent variation of product specificat...
Hwai-En Tseng, Chien-Chen Chang, Jia-Diann Li