4488 search results - page 225 / 898 » Focusing Search by Using Problem Solving Experience |
130
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a Q-learning based scheme for managing the partial coverage problem and the ill effects of free riding in unstructured P2P networks. Based on various parameter ...
130
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
142
click to vote
SIBGRAPI
2005
IEEE
15 years 9 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
152
click to vote
JCM
2007
15 years 4 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
163
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...