Sciweavers

400 search results - page 28 / 80
» Extended formulations in combinatorial optimization
Sort
View
CORR
2010
Springer
427views Education» more  CORR 2010»
14 years 10 months ago
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algori
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
Poonam Garg
MP
2006
75views more  MP 2006»
14 years 11 months ago
A Class of stochastic programs with decision dependent uncertainty
We address a class of problems where decisions have to be optimized over a time horizon given that the future is uncertain and that the optimization decisions influence the time o...
Vikas Goel, Ignacio E. Grossmann
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 6 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 8 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
CP
2009
Springer
16 years 12 days ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...