Sciweavers

1159 search results - page 45 / 232
» Binary Decision Graphs
Sort
View
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
14 years 19 days ago
Improving EAs for Sequencing Problems
Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. Howeve...
Wolfgang Günther, Rolf Drechsler
ASPDAC
2005
ACM
142views Hardware» more  ASPDAC 2005»
13 years 11 months ago
Bridging fault testability of BDD circuits
Abstract— In this paper we study the testability of circuits derived from Binary Decision Diagrams (BDDs) under the bridging fault model. It is shown that testability can be form...
Junhao Shi, Görschwin Fey, Rolf Drechsler
EVOW
2008
Springer
13 years 10 months ago
Genetic Programming in Statistical Arbitrage
Abstract. This paper employs genetic programming to discover statistical arbitrage strategies on the banking sector in the Euro Stoxx universe. Binary decision rules are evolved us...
Philip Saks, Dietmar G. Maringer
AAAI
2006
13 years 10 months ago
Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond
Two of the most efficient planners for planning in nondeterministic domains are MBP and ND-SHOP2. MBP achieves its efficiency by using Binary Decision Diagrams (BDDs) to represent...
Ugur Kuter, Dana S. Nau
ENDM
2010
122views more  ENDM 2010»
13 years 9 months ago
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
Vinícius G. P. de Sá, Celina M. Herr...