Sciweavers

5964 search results - page 181 / 1193
» A theory of speculative computation
Sort
View
185
Voted
LICS
1991
IEEE
15 years 10 months ago
The Fixed Point Property in Synthetic Domain Theory
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
Paul Taylor 0002
SIGDOC
2006
ACM
16 years 1 months ago
Building bridges: connecting research ethics and computer science
The ethical conduct of research is a cornerstone of modern scientific research. Computer science and the discipline’s technological artifacts touch nearly every aspect of moder...
Thomas L. Honeycutt, David R. Wright
159
Voted
CIE
2005
Springer
16 years 17 days ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
15 years 12 months ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer
201
Voted
PRL
1998
81views more  PRL 1998»
15 years 6 months ago
Lie generators for computing steerable functions
We present a computational, group-theoretic approach to steerable functions. The approach is group-theoretic in that the treatment involves continuous transformation groups for wh...
Patrick C. Teo, Yacov Hel-Or