Sciweavers

150 search results - page 22 / 30
» Complexity of the Unique Extension Problem in Default Logic
Sort
View
FCCM
2003
IEEE
113views VLSI» more  FCCM 2003»
15 years 2 months ago
Issues and Approaches to Coarse-Grain Reconfigurable Architecture Development
Although domain-specialized FPGAs can offer significant area, speed and power improvements over conventional reconfigurable devices, there are several unique and unexplored design...
Kenneth Eguro, Scott Hauck
GRID
2006
Springer
14 years 9 months ago
Monitoring and analysing a Grid Middleware Node
Distributed Grid applications are becoming more and more popular as the use of complex grid middlewares becomes extensive, and more facilities are offered by these complex pieces o...
Ramon Nou, Ferran Julià, David Carrera, Kev...
AUIC
2000
IEEE
15 years 1 months ago
Programming without a Computer: A New Interface for Children under Eight
Electronic Blocks are a new programming interface, designed for children aged between three and eight years. The Electronic Blocks programming environment includes sensor blocks, ...
Peta Wyeth, Helen C. Purchase
163
Voted
POPL
2006
ACM
15 years 9 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
ERSHOV
2009
Springer
15 years 1 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...