Sciweavers

7456 search results - page 1273 / 1492
» Parallelism in Logic Programming
Sort
View
123
Voted
IFIP
2004
Springer
15 years 9 months ago
A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
An Braeken, Christopher Wolf, Bart Preneel
132
Voted
IFIP
2004
Springer
15 years 9 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
123
Voted
IWMM
2004
Springer
127views Hardware» more  IWMM 2004»
15 years 9 months ago
Garbage-first garbage collection
Garbage-First is a server-style garbage collector, targeted for multi-processors with large memories, that meets a soft real-time goal with high probability, while achieving high ...
David Detlefs, Christine H. Flood, Steve Heller, T...
139
Voted
APCSAC
2003
IEEE
15 years 9 months ago
Mapping Applications to a Coarse Grain Reconfigurable System
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...
Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Mi...
CLUSTER
2003
IEEE
15 years 9 months ago
Distributed Recursive Sets: Programmability and Effectiveness for Data Intensive Applications
This paper presents a concurrent object model based on distributed recursive sets for data intensive applications that use complex, recursive data layouts. The set abstraction is ...
Roxana Diaconescu, Reidar Conradi
« Prev « First page 1273 / 1492 Last » Next »