Sciweavers

476 search results - page 80 / 96
» The Complexity of Equality Constraint Languages
Sort
View
ICFP
2005
ACM
14 years 10 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
COGSCI
2010
125views more  COGSCI 2010»
13 years 10 months ago
A Probabilistic Computational Model of Cross-Situational Word Learning
Words are the essence of communication: they are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisiti...
Afsaneh Fazly, Afra Alishahi, Suzanne Stevenson
JFP
2000
91views more  JFP 2000»
13 years 10 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
14 years 4 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
ICRA
2002
IEEE
108views Robotics» more  ICRA 2002»
14 years 3 months ago
An Execution Control System for Autonomous Robots
Abstract— This paper presents some recent developments of the LAAS architecture for autonomous mobile robots. In particular, we specify the role of the Execution Control level of...
François Felix Ingrand, Frederic Py