1106 search results - page 189 / 222 » On regularization algorithms in learning theory |
165
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
123
click to vote
ATAL
2011
Springer
14 years 4 months ago
2011
Springer
This research investigates event generalisation in computational episodic memory for artificial companions. Two studies indicated a preference of a biologically-inspired selectiv...
133
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
126
click to vote
SIGIR
2003
ACM
15 years 9 months ago
2003
ACM
We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arran...
145
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the...