7055 search results - page 334 / 1411 » Some New 4-Designs |
222
click to vote
FLOPS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
201
click to vote
ICML
1994
IEEE
15 years 10 months ago
1994
IEEE
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
164
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We present and formally investigate Cooperative Boolean Games, a new, natural family of coalitional games that are both compact and expressive. In such a game, an agent's pri...
187
click to vote
CIS
2008
Springer
15 years 8 months ago
2008
Springer
Rival Penalized Competitive Learning (RPCL) and its variants can perform clustering analysis efficiently with the ability of selecting the cluster number automatically. Although t...
198
click to vote
CLIMA
2004
15 years 8 months ago
2004
An important branch of investigation in the field agents has been the definition of high level languages for representing effects of actions, the programs written in such languages...