16257 search results - page 2916 / 3252 » D-finiteness: algorithms and applications |
200
click to vote
ACL
1997
15 years 8 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
185
click to vote
ICGA
1997
15 years 8 months ago
1997
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...
214
click to vote
BPSC
2009
15 years 8 months ago
2009
Abstract: In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle t levels of...
223
click to vote
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
188
click to vote
ICFP
2010
ACM
15 years 8 months ago
2010
ACM
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...