3096 search results - page 330 / 620 » The Generalized FITC Approximation |
165
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
231
click to vote
FSTTCS
1993
Springer
15 years 10 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
205
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
Real world multiagent coordination problems are important issues for reinforcement learning techniques. In general, these problems are partially observable and this characteristic ...
153
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most mu...
189
click to vote
COLT
1991
Springer
15 years 10 months ago
1991
Springer
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....