14158 search results - page 327 / 2832 » Generalized switch-setting problems |
160
Voted
TAMC
2010
Springer
15 years 9 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. ...
158
click to vote
ICDT
2010
ACM
15 years 9 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...
148
click to vote
GECCO
2009
Springer
15 years 9 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...
161
click to vote
ASIAN
1999
Springer
15 years 8 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. ...
144
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...