6455 search results - page 169 / 1291 » Research problems |
185
click to vote
AAAI
2006
15 years 7 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
166
click to vote
DNA
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
181
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
169
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
156
click to vote
PARA
1995
Springer
15 years 10 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...