Sciweavers

289 search results - page 14 / 58
» Acyclic Type of Relationships Between Autonomous Systems
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 9 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
ILP
1998
Springer
14 years 1 months ago
Strongly Typed Inductive Concept Learning
In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in...
Peter A. Flach, Christophe G. Giraud-Carrier, John...
EMSOFT
2004
Springer
14 years 2 months ago
A metrics system for quantifying operational coupling in embedded computer control systems
One central issue in system structuring and quality prediction is the interdependencies of system modules. This paper proposes a novel technique for determining the operational co...
De-Jiu Chen, Martin Törngren
WWW
2010
ACM
14 years 3 months ago
Exploring searcher interactions for distinguishing types of commercial intent
An improved understanding of the relationship between search intent, result quality, and searcher behavior is crucial for improving the effectiveness of web search. While recent p...
Qi Guo, Eugene Agichtein
CASES
2009
ACM
13 years 6 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis