Sciweavers

567 search results - page 69 / 114
» Decomposing replicable functions
Sort
View
DATE
2000
IEEE
169views Hardware» more  DATE 2000»
15 years 5 months ago
Transformational Placement and Synthesis
Novel methodology and algorithms to seamlessly integrate logic synthesis and physical placement through a transformational approach are presented. Contrary to most placement algor...
Wilm E. Donath, Prabhakar Kudva, Leon Stok, Paul V...
ESEC
1999
Springer
15 years 5 months ago
The CIP Method: Component- and Model-Based Construction of Embedded Systems
CIP is a model-based software development method for embedded systems. The problem of constructing an embedded system is decomposed into a functional and a connection problem. The ...
Hugo Fierz
CHI
1994
ACM
15 years 4 months ago
Using aggregation and dynamic queries for exploring large data sets
When working with large data sets, users perform three primary types of activities: data manipulation, data analysis, and data visualization. The data manipulation process involve...
Jade Goldstein, Steven F. Roth
PRICAI
2000
Springer
15 years 4 months ago
Generating Hierarchical Structure in Reinforcement Learning from State Variables
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
Bernhard Hengst
ENTCS
2007
103views more  ENTCS 2007»
15 years 22 days ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal