14165 search results - page 322 / 2833 » The generalized two-server problem |
173
click to vote
FCT
2005
Springer
16 years 6 days ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
191
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
200
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
191
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
205
click to vote
ASIAN
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...