1066 search results - page 170 / 214 » Computing Private Set Operations with Linear Complexities |
72
Voted
ASPDAC
2007
ACM
15 years 1 months ago
2007
ACM
Using multiple supply voltages on a SoC design is an efficient way to achieve low power. However, it may lead to a complex power network and a huge number of level shifters if we j...
101
click to vote
AAAI
2012
13 years 2 days ago
2012
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
CP
2000
Springer
15 years 1 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
122
click to vote
DIMACS
1996
14 years 11 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
DIGRA
2005
Springer
15 years 3 months ago
2005
Springer
An examination of the contributions that can be made by the field of non-mechanistic cybernetics (as elaborated by Gregory Bateson and Anthony Wilden) to a theory of videogames th...