Sciweavers

478 search results - page 35 / 96
» Monads of Regular Theories
Sort
View
CONCUR
2009
Springer
14 years 8 months ago
On Convergence of Concurrent Systems under Regular Interactions
Convergence is often the key liveness property for distributed systems that interact with physical processes. Techniques for proving convergence (asymptotic stability) have been ex...
Pavithra Prabhakar, Sayan Mitra, Mahesh Viswanatha...
ESANN
2004
15 years 11 days ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
ACS
2004
14 years 11 months ago
Descent Theory for Schemes
In this paper we continue the investigation of some aspects of descent theory for schemes that was begun in [11]. Let SCH be a category of schemes. We show that quasi-compact pure ...
Bachuki Mesablishvili
SIGCSE
1997
ACM
158views Education» more  SIGCSE 1997»
15 years 3 months ago
A collection of tools for making automata theory and formal languages come alive
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...
Susan H. Rodger, Anna O. Bilska, Kenneth H. Leider...
CSL
2004
Springer
15 years 4 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...