Sciweavers

1712 search results - page 49 / 343
» A Computational Approach to Binding Theory
Sort
View
COLING
1996
15 years 1 months ago
Focus and Higher-Order Unification
2 Focus theory Pulman has shown that Higher-Order Unifcation (HOU) can be used to model the interpretation of focus. In this paper, we extend the unification based approach to case...
Claire Gardent, Michael Kohlhase
ICNP
2002
IEEE
15 years 4 months ago
A Theory of Window-Based Unicast Congestion Control
This work presents a comprehensive theoretical framework for window-based congestion control protocols that are designed to converge to fairness and efficiency. We first derive ...
Nishanth R. Sastry, Simon S. Lam
ESANN
2006
15 years 1 months ago
Neural networks and machine learning in bioinformatics - theory and applications
Bioinformatics is a promising and innovative research field. Despite of a high number of techniques specifically dedicated to bioinformatics problems as well as many successful app...
Udo Seiffert, Barbara Hammer, Samuel Kaski, Thomas...
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
14 years 11 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
BANFF
1995
15 years 3 months ago
An Automata-Theoretic Approach to Linear Temporal Logic
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
Moshe Y. Vardi