95,571 Hits in 7.2 sec

A hybridized genetic parallel programming based logic circuit synthesizer

Wai Shing Lau, Kin Hong Lee, Kwong Sak Leung
2006 Proceedings of the 8th annual conference on Genetic and evolutionary computation - GECCO '06  
To show the effectiveness of the proposed HGPPLCS, six combinational logic circuit problems are used for evaluations. Each problem is run for 50 times.  ...  Genetic Parallel Programming (GPP) is a novel Genetic Programming paradigm.  ...  Firstly, we used the ESPRESSO [4] to optimize the truth tables of the six Boolean problems into optimal (or near optimal) sum of product (SOP) forms.  ... 
doi:10.1145/1143997.1144145 dblp:conf/gecco/LauLL06 fatcat:pwwoac3q4jftrpe5zn2duh3bm4

Symmetric Computation (Invited Talk)

Anuj Dawar, Michael Wagner
2020 Annual Conference for Computer Science Logic  
We discuss a recent convergence of notions of symmetric computation arising in the theory of linear programming, in logic and in circuit complexity.  ...  In this paper, we take a tour through results which show applications of these methods in a number of areas.  ...  Dawar 2:5 4 Linear Programming Linear programming is a widely used approach to solving combinatorial optimization problems.  ... 
doi:10.4230/lipics.csl.2020.2 dblp:conf/csl/Dawar20 fatcat:jdwa32g6rnfxhh5ed7mnjayrwe

Definability of semidefinite programming and lasserre lower bounds for CSPs

Anuj Dawar, Pengming Wang
2017 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)  
This generalizes an earlier result that the optimal value of a linear program can be expressed in this logic.  ...  We show that the ellipsoid method for solving semidefinite programs (SDPs) can be expressed in fixed-point logic with counting (FPC).  ...  This is established by considering the definability of semidefinite programs in logic, and using a measure of logical complexity, that we call counting width, to classify CSPs.  ... 
doi:10.1109/lics.2017.8005108 dblp:conf/lics/DawarW17 fatcat:zfndzw67efgvhfdhqegwd3bstq

The pushdown method to optimize chain logic programs [chapter]

Sergio Greco, Domenico Saccà, Carlo Zaniolo
1995 Lecture Notes in Computer Science  
The proposed method generalizes and unifies previous techniques such as the 'counting' and 'right-, left-, mixed-linear' methods.  ...  as a particular factorized left-linear program.  ...  In this paper, we present a new method for the optimization of bound chain queries that reduces to the counting method in all cases where the latter method behaves efficiently.  ... 
doi:10.1007/3-540-60084-1_102 fatcat:ysgy6tz66bfxpipp7f5bfxkude

Global flow optimization in automatic logic design

C.L. Berman, L.H. Trevillyan
1991 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
optimization • min-cut (and generally, linear programming) can handle costs via node/edge weights • useful for incorporating cell count, timing constraints cell count has gone up but the number of logic  ...  Linear program for connection minimization.  ... 
doi:10.1109/43.79493 fatcat:pzengat2fzbctfras7jyd33iei

Lasserre Lower Bounds and Definability of Semidefinite Programming [article]

Anuj Dawar, Pengming Wang
2016 arXiv   pre-print
fixed-point logic with counting.  ...  In particular, we show that if a finite-valued constraint problem is not solved exactly by its basic linear programming relaxation, it is also not solved exactly by any sub-linear number of levels of the  ...  This is established by considering the definability of semidefinite programs in logic, and using a measure of logical complexity, that we call counting width, to classify CSPs.  ... 
arXiv:1602.05409v2 fatcat:zm3ugy6fsbfzdlav5s54dkit7e

Page 1071 of American Rocket Society. ARS Journal Vol. 30, Issue SUPPLEMENT [page]

1960 American Rocket Society. ARS Journal  
The third part establishes the connection between the method of dynamic programming and the maximum principle, provides a method of solving the optimization problem for linear discrete systems, and also  ...  In the third part, the connection between the method of dynamic programming and the maximum principle is established, a method of solving the optimization problem in discrete linear systems is given, and  ... 

Book announcements

1993 Discrete Applied Mathematics  
Optimal strategy in two-person zero-sum games with 2 x 2 matrices. Optimal strategy in other two-person zero-sum games using geometric methods; model: cultural anthropology.  ...  PART 2: METHODS: THEORETICAL AND COMPUTATIONAL. Chapter 3: The General Linear-Programming Problem. The linear- programming problem.  ... 
doi:10.1016/0166-218x(93)90117-7 fatcat:mo4kjmd2czdg5hejcof7fmm6u4

An integer programming placement approach to FPGA clock power reduction

Alireza Rakhshanfar, Jason H. Anderson
2011 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)  
Our technique is intended to be used as an optimization post-pass executed after traditional placement, and it offers fine-grained control of the amount by which clock power is optimized versus other placement  ...  In this paper, we present a placement-based approach to clock power reduction based on an integer linear programming (ILP) formulation.  ...  Integer Linear Programming Linear programming (LP) is a formal optimization technique with broad application in CAD and other areas (such as operations re- search).  ... 
doi:10.1109/aspdac.2011.5722305 dblp:conf/aspdac/RakhshanfarA11 fatcat:ivbdn6t4znbxzau2hnagdlsgiu

Using artificial intelligence and fuzzy logic methods for selecting coating methods

S.G. Selivanov, A.A. Nourgaliyev
2013 Welding International  
The ways of application of artificial intelligence methods for optimization of design, perspective and directive technological processes of engine-building production in this publication are shown.  ...  of fuzzy logic and genetic algorithm are developed.  ...  The application of artificial intelligence techniques in the form of a logic-genetic method [1] for structural optimization of design technological processes consists in use of network counts and the  ... 
doi:10.1080/09507116.2013.840031 fatcat:krxibkheqrf7zodg4ttltonovy

A Definability Dichotomy for Finite Valued CSPs

Anuj Dawar, Pengming Wang, Marc Herbstritt
2015 Annual Conference for Computer Science Logic  
in infinitary logic with counting.  ...  the aim is to find an assignment of minimal cost.  ...  It states that any constraint language Γ falls into two cases: Either VCSP(Γ) is solvable in polynomial time, using its formulation as a linear program, the so-called basic linear program, or it is NP-hard  ... 
doi:10.4230/lipics.csl.2015.60 dblp:conf/csl/DawarW15 fatcat:izskkefaozeixmho7fgzormshq

Technology mapping algorithms for domino logic

Min Zhao, Sachin S. Sapatnekar
2002 ACM Transactions on Design Automation of Electronic Systems  
The mapping method is then extended to DAG covering that permits the implicit duplication of logic nodes.  ...  Our synthesis procedure maps the complementary logic cones independently when AND/OR logic is to be implemented, and together using dual-monotonic gates in the case of XOR/XNOR logic.  ...  Here, we use the linear program solver lp solve 2.3 [Berkelaar 1998 ] to solve the 0-1 integer linear programming formulations.  ... 
doi:10.1145/544536.544541 fatcat:oulggzrfv5bgpcy7btkjvbpk6e

Book announcements

1996 Discrete Applied Mathematics  
Chapter 2: Modeling Linear Optimization Problems. Linear programs in standard form. Modeling issues and nonlinear effects. Graphical solution of linear programs. Problem areas. Additional reading.  ...  Newton's method. The barrier method. Developing the algorithm. Summary. Additional reading. Chapter 8: Implementation Issues. Solving systems of linear equations.  ... 
doi:10.1016/0166-218x(96)90069-4 fatcat:eswucpcizbfdxbpbqejedzpsyu

Semiring Programming: A Declarative Framework for Generalized Sum Product Problems [article]

Vaishak Belle, Luc De Raedt
2020 arXiv   pre-print
To solve hard problems, AI relies on a variety of disciplines such as logic, probabilistic reasoning, machine learning and mathematical programming.  ...  The semantics of programs is defined in terms of first-order structures with semiring labels, which allows us to freely combine and integrate problems from different AI disciplines.  ...  In semiring programming, using the expressiveness of predicate logic, it is fairly straightforward to combine theories over possibly different signatures (e.g., propositional logic and linear arithmetic  ... 
arXiv:1609.06954v2 fatcat:jhcfx6adm5achggxa25hwdfkmq

A fanout optimization algorithm based on the effort delay model

P. Rezvani, M. Pedram
2003 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Index Terms-Buffer insertion, fanout optimization, gate sizing, logic design, logical effort.  ...  This paper presents a Logical Effort-based fanout OPtimizer for ARea and Delay (LEOPARD), which relies on the availability of a (near) continuous size buffer library.  ...  However, instead of using the conjugate gradient method as in [8] , we show that the problem can be solved elegantly by a sequence of linear programs.  ... 
doi:10.1109/tcad.2003.819423 fatcat:7ybpsa242zadjmzmav4isnjxyq
« Previous Showing results 1 — 15 out of 95,571 results