Sciweavers

507 search results - page 50 / 102
» Sizes of Ordered Decision Trees
Sort
View
CPE
1998
Springer
115views Hardware» more  CPE 1998»
14 years 2 days ago
On Choosing a Task Assignment Policy for a Distributed Server System
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve ord...
Mor Harchol-Balter, Mark Crovella, Cristina D. Mur...
CSDA
2008
126views more  CSDA 2008»
13 years 8 months ago
A new genetic algorithm in proteomics: Feature selection for SELDI-TOF data
Mass spectrometry from clinical specimens is used in order to identify biomarkers in a diagnosis. Thus, a reliable method for both feature selection and classification is required...
Christelle Reynès, Robert Sabatier, Nicolas...
DAC
1999
ACM
14 years 5 days ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
14 years 1 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
VTS
2006
IEEE
98views Hardware» more  VTS 2006»
14 years 1 months ago
Iterative OPDD Based Signal Probability Calculation
This paper presents an improved method to accurately estimate signal probabilities using ordered partial decision diagrams (OPDDs) [Kodavarti 93] for partial representation of the...
Avijit Dutta, Nur A. Touba