357 search results - page 25 / 72 » Solving Generalized Maximum Dispersion with Linear Programmi... |
IWMM
2009
Springer
14 years 3 months ago
2009
Springer
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
SIROCCO
2008
13 years 10 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
SAC
2004
ACM
14 years 2 months ago
2004
ACM
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...