Sciweavers

1635 search results - page 35 / 327
» Reasoning from Data Rather than Theory
Sort
View
LICS
2012
IEEE
11 years 11 months ago
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele...
COORDINATION
2004
Springer
14 years 2 months ago
Optimistic Concurrency Semantics for Transactions in Coordination Languages
There has been significant recent interest in exploring the role of coordination languages as middleware for distributed systems. These languages provide operations that allow pro...
Suresh Jagannathan, Jan Vitek
NIPS
2007
13 years 10 months ago
Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
M. M. Mahmud, Sylvian R. Ray
TIME
2006
IEEE
14 years 2 months ago
How Would You Like to Aggregate Your Temporal Data?
Published in: Proceedings of the 13th International Symposium on Temporal Representation and Reasoning (TIME-06), Budapest, Hungary, June 2006. IEEE Computer Society Press. Real-w...
Michael H. Böhlen, Johann Gamper, Christian S...
FOMI
2008
13 years 10 months ago
The Business of Ontology calls for a Formal Pragmatics
I develop a few suggestions how formal ontology can meet industry and practice. This is not just a matter of useful ontology-based applications. That is a necessary but also rather...
Hans Akkermans