Sciweavers

447 search results - page 38 / 90
» Decision trees with minimal costs
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
A Performance Comparison of Tree and Ring Topologies in Distributed Systems
A distributed system is a collection of computers that are connected via a communication network. Distributed systems have become commonplace due to the wide availability of low-c...
Min Huang, Brett Bode
SIGCOMM
1998
ACM
14 years 1 months ago
QoSMIC: Quality of Service Sensitive Multicast Internet Protocol
In this paper, we present, QoSMIC, a multicast protocol for the Internet that supports QoS-sensitive routing, and minimizes the importance of a priori con guration decisions such...
Michalis Faloutsos, Anindo Banerjea, Rajesh Pankaj
DAM
2007
100views more  DAM 2007»
13 years 8 months ago
Memory management optimization problems for integrated circuit simulators
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
Timothée Bossart, Alix Munier Kordon, Franc...
COCOA
2008
Springer
13 years 10 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 2 months ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...