3221 search results - page 386 / 645 » Termination of Linear Programs |
175
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
158
click to vote
IPCO
2001
15 years 8 months ago
2001
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
188
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
175
click to vote
WSC
2004
15 years 8 months ago
2004
Building computational models of real world systems usually requires the interaction of decision modules and simulation modules. Given different models and algorithms, the major h...
174
click to vote
WCE
2007
15 years 7 months ago
2007
—In this paper we used genetic algorithms to1 find the solution of game theory. We proposed new method foe solving game theory and find the optimal strategy for player A or playe...