8780 search results - page 217 / 1756 » On the Feasibility of Consistent Computations |
182
click to vote
ENTCS
2008
15 years 7 months ago
2008
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
208
click to vote
JAR
2006
15 years 7 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
194
click to vote
SIGCSE
2008
ACM
15 years 7 months ago
2008
ACM
Providing consistent, instant, and detailed feedback to students has been a big challenge in teaching Web based computing, given the complexity of project assignments and the comp...
149
click to vote
PROCEDIA
2010
15 years 5 months ago
2010
We propose a nonequilibrium sampling method for computing free energy profiles along a given reaction coordinate. The method consists of two parts: a controlled Langevin sampler ...
236
click to vote
IBERAMIA
2010
Springer
15 years 5 months ago
2010
Springer
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...