Sciweavers

1686 search results - page 18 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ECAL
2007
Springer
16 years 1 days ago
Turing Complete Catalytic Particle Computers
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
Anthony M. L. Liekens, Chrisantha Thomas Fernando
SIGDIAL
2010
15 years 3 months ago
Dialogue Act Modeling in a Complex Task-Oriented Domain
Classifying the dialogue act of a user utterance is a key functionality of a dialogue management system. This paper presents a data-driven dialogue act classifier that is learned ...
Kristy Elizabeth Boyer, Eun Y. Ha, Robert Phillips...
ASP
2005
Springer
15 years 11 months ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi
IPPS
2000
IEEE
15 years 10 months ago
Solving Problems on Parallel Computers by Cellular Programming
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
Domenico Talia
GCC
2003
Springer
15 years 11 months ago
Coarse-Grained Distributed Parallel Programming Interface for Grid Computing
Abstract. In this paper, a practical coarse-grained distributed parallel programming interface for grid computing (PI4GC) is introduced. des a group of generic and abstract functio...
Yongwei Wu, Qing Wang, Guangwen Yang, Weimin Zheng