Sciweavers

4940 search results - page 14 / 988
» On the Complexity of Universal Programs
Sort
View
COLING
2002
13 years 7 months ago
A Linguistic Discovery Program that Verbalizes its Discoveries
We describe a discovery program, called UNIVAUTO (UNIVersals AUthoringTOol), whose domain of application is the study of language universals, a classic trend in contemporary lingu...
Vladimir Pericliev
IFIP
1998
Springer
13 years 11 months ago
Scheduling in a Multi-Agent Environment
A new scheduling agent for existing CIM multi-agent system is being currently developed at the Technical University of Kosice. The basic idea is to create an agent based on Schedu...
M. Schmotzer, Jan Paralic, Julius Csontó
ICALT
2003
IEEE
14 years 21 days ago
Educational Robotics in a Systems Design Masters Program
This paper presents the concepts of our MoRob (Modular Educational Robotic Toolbox) project, which aims to provide a robot platform for university teaching and research. Character...
Uwe Gerecke, Patrick Hohmann, Bernardo Wagner
CASES
2008
ACM
13 years 9 months ago
SoC-C: efficient programming abstractions for heterogeneous multicore systems on chip
fficient Programming Abstractions for Heterogeneous Multicore Systems on Chip Alastair D. Reid Krisztian Flautner Edmund Grimley-Evans ARM Ltd Yuan Lin University of Michigan The ...
Alastair D. Reid, Krisztián Flautner, Edmun...
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 7 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter