181 search results - page 36 / 37 » Binary Change Set Composition |
STOC
1993
ACM
13 years 11 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
GPCE
2008
Springer
13 years 8 months ago
2008
Springer
A user interface, such as a dialog, assists a user in synthesising a set of values, typically parameters for a command object. Code for “command parameter synthesis” is usuall...
CACM
2005
13 years 7 months ago
2005
This paper presents a set of architectures for the composition of ubiquitous computing applications. It describes research that is being carried out in "extrovert-Gadgets&quo...