Sciweavers

3229 search results - page 206 / 646
» Mixing
Sort
View
CPAIOR
2010
Springer
15 years 8 months ago
Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
Elvin Coban, John N. Hooker
ALDT
2009
Springer
184views Algorithms» more  ALDT 2009»
15 years 8 months ago
Inverse Analysis from a Condorcet Robustness Denotation of Valued Outranking Relations
In this article we develop an indirect approach for assessing criteria significance weights from the robustness of the significance that a decision maker acknowledges for his pai...
Raymond Bisdorff, Patrick Meyer, Thomas Veneziano
GECON
2009
Springer
113views Business» more  GECON 2009»
15 years 8 months ago
Cost Optimization Model for Business Applications in Virtualized Grid Environments
Abstract. The advent of Grid computing gives enterprises an ever increasing choice of computing options, yet research has so far hardly addressed the problem of mixing the differe...
Jörg Strebel
IPPS
2000
IEEE
15 years 7 months ago
A Decision-Process Analysis of Implicit Coscheduling
ThispaperpresentsatheoreticalframeworkbasedonBayesian decision theory for analyzing recently reported results on implicit coscheduling of parallel applications on clusters of work...
Radha Poovendran, Peter J. Keleher, John S. Baras
110
Voted
AES
2000
Springer
136views Cryptology» more  AES 2000»
15 years 7 months ago
MARS Attacks! Preliminary Cryptanalysis of Reduced-Round MARS Variants
Abstract. In this paper, we discuss ways to attack various reducedround variants of MARS. We consider cryptanalysis of two reducedround variants of MARS: MARS with the full mixing ...
John Kelsey, Bruce Schneier