Sciweavers

4430 search results - page 218 / 886
» Solving Optimization Problems with DLL
Sort
View
EAAI
2010
107views more  EAAI 2010»
14 years 10 months ago
Honey bee social foraging algorithms for resource allocation: Theory and application
A model of honey bee social foraging is introduced to create an algorithm that solves a class of optimal resource allocation problems. We prove that if several such algorithms (&q...
Nicanor Quijano, Kevin M. Passino
ANTSW
2004
Springer
15 years 9 months ago
S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
Walter J. Gutjahr
HSNMC
2004
Springer
126views Multimedia» more  HSNMC 2004»
15 years 9 months ago
Hybrid Unicast and Multicast Flow Control: A Linear Optimization Approach
— In this paper, we present a solution to the general problem of flow control for both unicast and multicast IP networks. We formulate a convex optimization problem that can be ...
Homayoun Yousefi'zadeh, Fatemeh Fazel, Hamid Jafar...
EOR
2006
87views more  EOR 2006»
15 years 3 months ago
Applying machine based decomposition in 2-machine flow shops
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
Saral Mukherjee, A. K. Chatterjee
ICS
2010
Tsinghua U.
16 years 1 months ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial