Sciweavers

14774 search results - page 2758 / 2955
» Computational complexity and evolutionary computation
Sort
View
CMSB
2006
Springer
15 years 10 months ago
Type Inference in Systems Biology
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
François Fages, Sylvain Soliman
COLT
2006
Springer
15 years 10 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
CSR
2006
Springer
15 years 10 months ago
Conjugacy and Equivalence of Weighted Automata and Functional Transducers
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
Marie-Pierre Béal, Sylvain Lombardy, Jacque...
DRM
2006
Springer
15 years 10 months ago
The problem with rights expression languages
In this paper we consider the functionality that a rights expression language (REL) should provide within a digital rights management (DRM) environment. We begin by noting the dea...
Pramod A. Jamkhedkar, Gregory L. Heileman, Iv&aacu...
EMSOFT
2006
Springer
15 years 10 months ago
Modeling a system controller for timing analysis
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
Stephan Thesing
« Prev « First page 2758 / 2955 Last » Next »