Sciweavers

567 search results - page 54 / 114
» Decomposing replicable functions
Sort
View
DAC
1996
ACM
15 years 1 months ago
Delay Minimal Decomposition of Multiplexers in Technology Mapping
Technology mapping requires the unmapped logic network to be represented in terms of base functions, usually two-input NORs and inverters. Technology decomposition is the step tha...
Shashidhar Thakur, D. F. Wong, Shankar Krishnamoor...
FTRTFT
1994
Springer
15 years 1 months ago
Specification and Refinement of Finite Dataflow Networks - a Relational Approach
We specify the black box behavior of dataflow components by characterizing the relation between their input and their output histories. We distinguish between three main classes of...
Manfred Broy, Ketil Stølen
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 1 months ago
gLINC: identifying composability using group perturbation
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
David Jonathan Coffin, Christopher D. Clack
RE
1995
Springer
15 years 1 months ago
Using non-functional requirements to systematically support change
Non-Functional requirements (or quality requirements, NFRs) such as confidentiality, performance and timeliness are often crucial to a software system. Our NFRFramework treats NF...
Lawrence Chung, Brian A. Nixon, Eric S. K. Yu
ARGMAS
2008
Springer
14 years 11 months ago
A Dialogue Mechanism for Public Argumentation Using Conversation Policies
In this paper, we propose a flexible dialogue mechanism through which a set of agents can establish a coherent set of public beliefs. Flexibility and coherence are achieved by dec...
Yuqing Tang, Simon Parsons