Sciweavers

381 search results - page 27 / 77
» On the advantage over a random assignment
Sort
View
ANOR
2006
133views more  ANOR 2006»
13 years 8 months ago
An integrated model for logistics network design
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. Our formulation is flexi...
Jean-François Cordeau, Federico Pasin, Mari...
CCGRID
2004
IEEE
13 years 11 months ago
Lambda scheduling algorithm for file transfers on high-speed optical circuits
1 Scheduling resources on Grids is a well-known problem. The extension of Grids to LambdaGrids requires scheduling of lambdas, i.e., end-to-end high-speed circuits. In this paper, ...
Hua Lee, Malathi Veeraraghavan, Hojun Li, Edwin K....
IJAR
2010
120views more  IJAR 2010»
13 years 6 months ago
Comparison of tightly and loosely coupled decision paradigms in multiagent expedition
Frameworks for cooperative multiagent decision making may be divided into those where each agent is assigned a single variable (SVFs) and those where each agent carries an interna...
Yang Xiang, Franklin Hanshar
IPMI
2003
Springer
14 years 8 months ago
A New & Robust Information Theoretic Measure and Its Application to Image Alignment
In this paper we develop a novel measure of information in a random variable based on its cumulative distribution that we dub cumulative residual entropy (CRE). This measure parall...
Fei Wang, Baba C. Vemuri, Murali Rao, Yunmei Chen
ICTAI
2003
IEEE
14 years 1 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière