Sciweavers

14774 search results - page 240 / 2955
» Computational complexity and evolutionary computation
Sort
View
AIPS
2006
15 years 6 months ago
Automated Planning Using Quantum Computation
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
Sanjeev Naguleswaran, Langford B. White, I. Fuss
CACM
2010
117views more  CACM 2010»
15 years 5 months ago
Computing arbitrary functions of encrypted data
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorph...
Craig Gentry
ANNALS
2006
63views more  ANNALS 2006»
15 years 5 months ago
The Virtual Life of ENIAC: Simulating the Operation of the First Electronic Computer
This paper describes an interactive simulation of the Electronical Numerical Integrator and Computer (ENIAC). With the simulator, the user can wire up complex configurations of th...
Till Zoppke, Raúl Rojas
IPL
2006
69views more  IPL 2006»
15 years 5 months ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
André Große, Jörg Rothe, Gerd We...
SIGPRO
2008
89views more  SIGPRO 2008»
15 years 5 months ago
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
Huazhong Shu, J. S. Wu, Lotfi Senhadji, Limin Luo