Sciweavers

447 search results - page 16 / 90
» Decision trees with minimal costs
Sort
View
ICMCS
2006
IEEE
117views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Offering Differentiated Services in Peer-to-Peer Multimedia Multicast
In traditional overlay multicast network, all peers are treated as equal regardless of their importance and contribution to the network. In this paper, we consider that each user ...
Kan-Leung Cheng, Xing Jin, S.-H. Gary Chan
ANOR
2005
110views more  ANOR 2005»
13 years 8 months ago
Managing Cost Overrun Risk in Project Funding Allocation
This paper discusses decision making of project funding allocation under uncertain project costs. Because project costs are uncertain and funding allocations may not necessarily ma...
Chung-Li Tseng, Kyle Y. Lin, Satheesh K. Sundarara...
ECIS
2003
13 years 10 months ago
An architecture model for supporting application integration decisions
For a successful information systems architecture management, reference models and decision rules must be provided. In this paper, an architecture model and design rules are propo...
Robert Winter
APPROX
2005
Springer
131views Algorithms» more  APPROX 2005»
14 years 2 months ago
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
Jan Remy, Angelika Steger
ALGORITHMICA
2008
63views more  ALGORITHMICA 2008»
13 years 9 months ago
The Swap Edges of a Multiple-Sources Routing Tree
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao