Sciweavers

150 search results - page 30 / 30
» Complexity of the Unique Extension Problem in Default Logic
Sort
View
ICFP
2007
ACM
14 years 5 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
INFORMATICALT
2010
138views more  INFORMATICALT 2010»
13 years 2 months ago
Recognition of Human Emotions in Reasoning Algorithms of Wheelchair Type Robots
This paper analyses the possibilities of integrating different technological and knowledge representation techniques for the development of a framework for the remote control of mu...
Dale Dzemydiene, Antanas Andrius Bielskis, Arunas ...
SAC
2008
ACM
13 years 4 months ago
A generic XML language for characterising objects to support digital preservation
The dominance of digital objects in today's information landscape has changed the way humankind creates and exchanges information. However, it has also brought an entirely ne...
Christoph Becker, Andreas Rauber, Volker Heydegger...
PLDI
2006
ACM
13 years 11 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann
DATE
1999
IEEE
194views Hardware» more  DATE 1999»
13 years 9 months ago
CRUSADE: Hardware/Software Co-Synthesis of Dynamically Reconfigurable Heterogeneous Real-Time Distributed Embedded Systems
Dynamically reconfigurable embedded systems offer potential for higher performance as well as adaptability to changing system requirements at low cost. Such systems employ run-tim...
Bharat P. Dav