Sciweavers

68 search results - page 5 / 14
» Dynamics of the Binary Euclidean Algorithm: Functional Analy...
Sort
View
DAC
1999
ACM
13 years 11 months 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
SIGSOFT
2004
ACM
14 years 8 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 7 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
ISDA
2005
IEEE
14 years 1 months ago
Multiobjective Optimization Using Adaptive Pareto Archived Evolution Strategy
This paper proposes a novel adaptive representation for evolutionary multiobjective optimization for solving a stock modeling problem. The standard Pareto Achieved Evolution Strat...
Mihai Oltean, Crina Grosan, Ajith Abraham, Mario K...
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 28 days ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki