Sciweavers

529 search results - page 89 / 106
» Simple Random Logic Programs
Sort
View
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
14 years 2 months ago
Optimal latch mapping and retiming within a tree
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
Joel Grodstein, Eric Lehman, Heather Harkness, Her...
CACM
1998
110views more  CACM 1998»
13 years 9 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
ICTAI
2008
IEEE
14 years 4 months ago
The System BioC for Reasoning about Biological Models in Action Language C
We elaborate upon the usage of action language C for representing and reasoning about biological models. First, we provide a simple extension of C allowing for variables and show ...
Steve Dworschak, Torsten Grote, Arne König, T...
IPPS
1999
IEEE
14 years 2 months ago
Marshaling/Demarshaling as a Compilation/Interpretation Process
Marshaling is the process through which structured values are serialized into a stream of bytes; demarshaling converts this stream of bytes back to structured values. Most often, ...
Christian Queinnec
ENTCS
2008
64views more  ENTCS 2008»
13 years 10 months ago
General Refinement, Part Two: Flexible Refinement
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
Steve Reeves, David Streader