Sciweavers

59 search results - page 10 / 12
» Linear options
Sort
View
4OR
2010
148views more  4OR 2010»
13 years 5 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
GLOBECOM
2010
IEEE
13 years 5 months ago
Energy-Efficient WDM Network Planning with Dedicated Protection Resources in Sleep Mode
Abstract--Energy-efficient optical networks are gaining momentum as environmental-friendly solutions with reduced operational costs. Energy-efficiency can be achieved by using devi...
Ajmal Muhammad, Paolo Monti, Isabella Cerutti, Len...
CLUSTER
2009
IEEE
13 years 5 months ago
MITHRA: Multiple data independent tasks on a heterogeneous resource architecture
With the advent of high-performance COTS clusters, there is a need for a simple, scalable and faulttolerant parallel programming and execution paradigm. In this paper, we show that...
Reza Farivar, Abhishek Verma, Ellick Chan, Roy H. ...
AOR
2006
95views more  AOR 2006»
13 years 7 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
SBBD
2008
256views Database» more  SBBD 2008»
13 years 9 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...