530 search results - page 24 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
120
click to vote
AAAI
2012
13 years 5 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
114
click to vote
ORL
2008
15 years 3 months ago
2008
This paper presents an algorithm that converges to points that satisfy a first order necessary condition of weakly Pareto solutions of multiobjective optimization problems. Hints ...
103
click to vote
ISAAC
2001
Springer
15 years 7 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
134
click to vote
TCS
2010
15 years 1 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
112
click to vote
NHM
2010
14 years 10 months ago
2010
We introduce nonoverlapping domain decomposition algorithms of Schwarz waveform relaxation type for the semilinear reaction-diffusion equation. We define linear Robin and second or...