Sciweavers

1675 search results - page 266 / 335
» Some thoughts on teaching programming and programming langua...
Sort
View
IFIP
2004
Springer
14 years 2 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
IFIP
2004
Springer
14 years 2 months ago
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
IFIP
2004
Springer
14 years 2 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
ATAL
2003
Springer
14 years 2 months ago
Communication for Goal Directed Agents
This paper discusses some modeling issues concerning the communication between goal-directed agents. In particular, the role of performatives in agent communication is discussed. I...
Mehdi Dastani, Jeroen van der Ham, Frank Dignum
CP
2003
Springer
14 years 2 months ago
Unrestricted Nogood Recording in CSP Search
Recently spectacular improvements in the performance of SAT solvers have been achieved through nogood recording (clause learning). In the CSP literature, on the other hand, nogood ...
George Katsirelos, Fahiem Bacchus