نتایج جستجو برای: variable ordering structure

تعداد نتایج: 1816107  

1997
Takashi HORIYAMA Shuzo YAJIMA

An Ordered Binary Decision Diagram (OBDD) is a directed acyclic graph representing a Boolean function. The size of OBDDs largely depends on the variable ordering. In this paper, we show the size of the OBDD representing the i-th bit of the output of n-bit/n-bit integer division is (2 (n?i)=8) for any variable ordering. We also show that _-OBDDs, ^-OBDDs and-OBDDs representing integer division h...

2015
Mohamed Wahbi Younes Mechqrane Christian Bessiere Kenneth N. Brown

Reordering agents during search is an essential component of the efficiency of solving a distributed constraint satisfaction problem. Termination values have been recently proposed as a way to simulate the min-domain dynamic variable ordering heuristic. The use of termination values allows the greatest flexibility in reordering agents dynamically while keeping polynomial space. In this paper, w...

2007
Nina Narodytska Toby Walsh

To facilitate interactive design, the solutions to configuration problems can be compiled into a decision diagram. We develop three heuristics for reducing the time and space required to do this. These heuristics are based on the distinctive clustered and hierarchical structure of the constraint graphs of configuration problems. The first heuristic attempts to limit the growth in the size of th...

2001
Carlos Garćıa González Dionisio Pérez-Brito

A Systematic change of Neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and global optimization. In this paper we present a Variable Neighborhood Search implementation designed to find high quality solutions for the NP-hard Linear Ordering Problem, which has a significant number of application in practice, such triang...

2007
Anuj Dawar Lauri Hella

Let Q be a nite set of generalized quantiiers. By L k (Q) we denote the k-variable fragment of FO(Q), rst order logic extended with Q. We show that for each k, there is a PFP(Q)-deenable linear pre-order whose equivalence classes in any nite structure A are the L k (Q)-types in A. For some special classes of generalized quantiiers Q, we show that such an ordering of L k (Q)-types is already dee...

2012
Manoj Singhal Girish Sharma

Binary Decision Diagrams and Its Variable Ordering for Disjoint Network Manoj Singhal Associate professor, Department of Information Technology, Accurate Institute of Management & Technology, Greater Noida (U.P.), India, Email: [email protected] Girish Sharma Associate Professor, Department of Computer Applications, Bhai Parmanand Institute of Business Studies, New Delhi Email: gkps1...

Journal: :Quality and Reliability Engineering International 2001

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید