Sciweavers

2503 search results - page 407 / 501
» A study of 3-arc graphs
Sort
View
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 10 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
Guolong Lin, Rajmohan Rajaraman
SIAMDM
2008
77views more  SIAMDM 2008»
13 years 10 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....
APPML
2005
68views more  APPML 2005»
13 years 10 months ago
A note on edge fault tolerance with respect to hypercubes
In the previous studies on k-edge fault tolerance with respect to hypercubes Qn, matrices for generating linear k-EFT(Qn) graphs were used. Let EFTL(n, k) denote the set of matric...
Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu
TIT
2008
103views more  TIT 2008»
13 years 10 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
TVCG
2008
140views more  TVCG 2008»
13 years 10 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...