2771 search results - page 370 / 555 » A General Computational Treatment of the Comparative |
197
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
189
click to vote
GLVLSI
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
203
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 ...
162
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
157
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Preferences of a single agent are often partially ordered. For example, it may be hard to compare a novel with a biography. In such a situation, the agent may want the novel and t...