Sciweavers

2606 search results - page 15 / 522
» cost 2008
Sort
View
EOR
2008
66views more  EOR 2008»
14 years 9 months ago
"Optimistic" weighted Shapley rules in minimum cost spanning tree problems
We introduce optimistic weighted Shapley rules in minimum cost spanning tree problems. We dene them as the weighted Shapley values of the optimistic game v+ introduced in Berganti
Gustavo Bergantiños, Silvia Lorenzo-Freire
EOR
2008
268views more  EOR 2008»
14 years 9 months ago
A survey of scheduling problems with setup times or costs
The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by [Allahverdi, A., Gupta, J.N.D., Aldowaisan, T., 1999. A review of s...
Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikha...
TVLSI
2008
123views more  TVLSI 2008»
14 years 9 months ago
Cost-Efficient SHA Hardware Accelerators
Abstract--This paper presents a new set of techniques for hardware implementations of Secure Hash Algorithm (SHA) hash functions. These techniques consist mostly in operation resch...
Ricardo Chaves, Georgi Kuzmanov, Leonel Sousa, Sta...
DM
2002
100views more  DM 2002»
14 years 9 months ago
A branch-and-cut approach for minimum cost multi-level network design
Network design models with more than one facility type have many applications in communication and distribution problems. Due to their complexity, previous studies have focused on...
Sunil Chopra, Chih-Yang Tsai
PPL
2008
88views more  PPL 2008»
14 years 9 months ago
Evaluating Computational Costs while Handling Data and Control Parallelism
The aim of this work is to introduce a computational costs system associated to a semantic framework for orthogonal data and control parallelism handling. In such a framework a pa...
Sonia Campa