5964 search results - page 371 / 1193 » A theory of speculative computation |
190
click to vote
DCC
2006
IEEE
16 years 7 months ago
2006
IEEE
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
204
click to vote
SAGT
2009
Springer
16 years 2 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...
154
click to vote
FUN
2007
Springer
16 years 1 months 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...
247
click to vote
JSAI
2007
Springer
16 years 1 months 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...
200
click to vote
SPAA
2005
ACM
16 years 1 months 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...