987 search results - page 123 / 198 » A new Informative Generic Base of Association Rules |
171
click to vote
AAAI
2012
13 years 8 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
143
click to vote
ENTCS
2008
15 years 6 months ago
2008
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
165
click to vote
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We present a simple, fast, and effective method to detect defects on textured surfaces. Our method is unsupervised and contains no learning stage or information on the texture bei...
160
click to vote
POPL
2012
ACM
14 years 1 months ago
2012
ACM
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
111
click to vote
EKAW
2008
Springer
15 years 7 months ago
2008
Springer
Most practically relevant domains include some degree of conceptual dynamics, i.e. new conceptual elements arise, and some old ones become irrelevant. This type of change imposes a...