5608 search results - page 346 / 1122 » On the Theory of Matchgate Computations |
173
click to vote
SAGT
2009
Springer
16 years 1 months ago
2009
Springer
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
142
click to vote
FUN
2007
Springer
16 years 29 days ago
2007
Springer
In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm th...
234
click to vote
JSAI
2007
Springer
16 years 28 days ago
2007
Springer
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
180
click to vote
SPAA
2005
ACM
16 years 10 days ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
169
click to vote
CP
2005
Springer
16 years 10 days ago
2005
Springer
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...