Sciweavers

43 search results - page 7 / 9
» A Comparative Study of Arithmetic Constraints on Integer Int...
Sort
View
IPPS
2007
IEEE
15 years 3 months ago
Strategies for Replica Placement in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
Anne Benoit, Veronika Rehn, Yves Robert
TPDS
2008
72views more  TPDS 2008»
14 years 9 months ago
Replica Placement and Access Policies in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
Anne Benoit, Veronika Rehn-Sonigo, Yves Robert
CP
2009
Springer
15 years 10 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
INFOCOM
2009
IEEE
15 years 4 months ago
Impairment-Aware Offline RWA for Transparent Optical Networks
—We consider the offline version of the routing and wavelength assignment (RWA) problem in transparent all-optical networks. In such networks and in the absence of regenerators, ...
Konstantinos Manousakis, Kostas Christodoulopoulos...
EOR
2010
102views more  EOR 2010»
14 years 9 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...