2747 search results - page 148 / 550 » Non-oblivious Strategy Improvement |
159
click to vote
ACL
1998
15 years 7 months ago
1998
In this paper we examine how the differences in modelling between different data driven systems performing the same NLP task can be exploited to yield a higher accuracy than the b...
141
click to vote
ICEC
1994
15 years 7 months ago
1994
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
169
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
162
click to vote
COCOON
1997
Springer
15 years 10 months ago
1997
Springer
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
165
click to vote
TEC
2002
15 years 6 months ago
2002
We present an optimization algorithm based on a model of bacterial chemotaxis. The original biological model is used to formulate a simple optimization algorithm, which is evaluate...