Sciweavers

1686 search results - page 48 / 338
» Programs as polygraphs: computability and complexity
Sort
View
72
Voted
AIPS
2006
14 years 11 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
ANNALS
2006
63views more  ANNALS 2006»
14 years 9 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
INFSOF
2002
78views more  INFSOF 2002»
14 years 9 months ago
Flow insensitive points-to sets
Pointer analysis is an important part of source code analysis. Many programs that manipulate source code take points-to sets as part of their input. Points-to related data collect...
Paul Anderson, David Binkley, Genevieve Rosay, Tim...
TCSB
2010
14 years 8 months ago
Modelling Self-assembly in BlenX
Abstract. The process through which disordered components spontaneously arrange themselves into patterns is called self-assembly. Molecular self-assembly describes the process by w...
Roberto Larcher, Corrado Priami, Alessandro Romane...
73
Voted
ACL
2009
14 years 7 months ago
Recognizing Stances in Online Debates
This paper presents an unsupervised opinion analysis method for debate-side classification, i.e., recognizing which stance a person is taking in an online debate. In order to hand...
Swapna Somasundaran, Janyce Wiebe