Filters








63,901 Hits in 4.8 sec

Search techniques for SAT-based Boolean optimization

Fadi A. Aloul
2006 Journal of the Franklin Institute  
In general, most SAT solvers are applied to Boolean decision problems that are expressed in conjunctive normal form (CNF).  ...  Another significant advantage of PB constraints is its ability to express Boolean optimization problems. This allows for new applications that were never handled by SAT solvers before.  ...  We then describe, in Section 4, the two SAT-based techniques to solve Boolean optimization problems.  ... 
doi:10.1016/j.jfranklin.2006.01.003 fatcat:gay5fwpibrfvbc7tqzffkhranm

Simulation of Boolean Query Implementation Strategy in Lucene

Ran LI, Xiaojin WU
2019 DEStech Transactions on Computer Science and Engineering  
The deeply study of Boolean query's implementation strategy is conducive to flexible application of Boolean query, optimization of query expression and improvement of execution efficiency.  ...  Starting with the implementation strategy of Boolean query in Lucene framework, this paper studies the representation, execution sequence diagram, logical operation rules and sub-query merging algorithm  ...  From the experimental data in Table IV , it can be seen that the Boolean expression optimization rule listed in Table III is correct, and the execution efficiency of optimization is improved.  ... 
doi:10.12783/dtcse/iccis2019/31952 fatcat:mg5pdvv3izgeffu2halylk4guy

PDA‐based Boolean Function Simplification: a Useful Educational Tool

Ledion Bitincka, George E. Antoniou
2004 Informatica  
In this paper a useful educational tool is presented for minimizing low order Boolean expressions. The algorithm follows the Karnaugh map looping approach and provides optimal results.  ...  In order to make the overall implementation efficient, the object oriented approach was used. Two step-by-step examples are presented to illustrate the efficiency of the proposed algorithm.  ...  The simplified Boolean expression (4) is the optimal solution for the given Boolean expression (3).  ... 
doi:10.15388/informatica.2004.064 fatcat:3x65y5k3rrdvvjkmouowr6hiui

Optimizing disjunctive queries with expensive predicates

A. Kemper, G. Moerkotte, K. Peithner, M. Steinbrunn
1994 Proceedings of the 1994 ACM SIGMOD international conference on Management of data - SIGMOD '94  
function in an object-oriented or extended relational model may be orders of magnitude more expensive than an attribute access (and comparison).  ...  In order to v~date the viability of bypass evaluation, we extend a previously developed optimizer architecture and incorporate three alternative optimization algorithms for generating bypass processing  ...  We gratefully acknowledge Guy Lehman's constructive help in revising the paper,  ... 
doi:10.1145/191839.191906 dblp:conf/sigmod/KemperMPS94 fatcat:i6h5csz2onf4jpafercpenb634

Optimizing disjunctive queries with expensive predicates

A. Kemper, G. Moerkotte, K. Peithner, M. Steinbrunn
1994 SIGMOD record  
function in an object-oriented or extended relational model may be orders of magnitude more expensive than an attribute access (and comparison).  ...  In order to v~date the viability of bypass evaluation, we extend a previously developed optimizer architecture and incorporate three alternative optimization algorithms for generating bypass processing  ...  We gratefully acknowledge Guy Lehman's constructive help in revising the paper,  ... 
doi:10.1145/191843.191906 fatcat:nbk4ty5fdbauhlglitel4mp33m

Approximate Boolean Reasoning Approach to Rough Sets and Data Mining [chapter]

Hung Son Nguyen
2005 Lecture Notes in Computer Science  
Many problems in rough set theory have been successfully solved by boolean reasoning (BR) approach. The disadvantage of this elegant methodology is based on its high space and time complexity.  ...  In this paper we present a modified BR approach that can overcome those difficulties. This methodology is called the approximate boolean reasoning (ABR) approach.  ...  The general boolean reasoning scheme (BR-scheme) for optimization problems is presented in Figure 1 .  ... 
doi:10.1007/11548706_2 fatcat:4caan6kswrcpxjeir2dxr4tljq

Multi-objective evolutionary optimization for generating ensembles of classifiers in the ROC space

Julien-Charles Levesque, Audrey Durand, Christian Gagne, Robert Sabourin
2012 Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference - GECCO '12  
In this paper, we propose a novel approach for the multiobjective optimization of classifier ensembles in the ROC space.  ...  We first evolve a pool of simple classifiers with NSGA-II using values of the ROC curves as the optimization objectives.  ...  L stands for linear base classifiers and GP for expression trees.  ... 
doi:10.1145/2330163.2330285 dblp:conf/gecco/LevesqueDGS12 fatcat:apcuvybdzbe5pmbai5th4x7dki

Solving Boolean Combinations of Nonlinear Numerical Constraints

Xiao-Hui JI
2005 Journal of Software (Chinese)  
A new method is presented in this paper to solve Boolean combinations of nonlinear numerical constraints completely.  ...  Constraints involving Boolean and numerical variables are used widely, but it is difficult to solve especially when they contain nonlinear numerical expressions.  ...  In an interval method, a real number is not expressed by of . The global optimization solving method is like that in Fig.3 . a 1. Input an initial interval vector X. 2.  ... 
doi:10.1360/jos160659 fatcat:woi5fm6ojze4hj7zlj7al35cfe

Learning to Follow Language Instructions with Compositional Policies [article]

Vanya Cohen, Geraud Nangue Tasse, Nakul Gopalan, Steven James, Matthew Gombolay, Benjamin Rosman
2021 arXiv   pre-print
First, we train a reinforcement learning agent to learn value functions that can be subsequently composed through a Boolean algebra to solve novel tasks.  ...  Evaluating our agent in the BabyAI domain, we observe a decrease of 86% in the number of training steps needed to learn a second task after mastering a single task.  ...  The rewards of +1.0 and −2.0 were determined empirically to incentivize the production of optimal Boolean expressions.  ... 
arXiv:2110.04647v1 fatcat:nm3bml2tanghpldkwnn2b4kjd4

A computational tool for the simulation and optimization of microbial strains accounting integrated metabolic/regulatory information

Paulo Vilaça, Isabel Rocha, Miguel Rocha
2011 Biosystems (Amsterdam. Print)  
Availability: The plug-in is made available in the OptFlux web site (www.optflux.org) together with examples and documentation.  ...  and scope: Recently, a number of methods and tools have been proposed to allow the use of genome-scale metabolic models for the phenotype simulation and optimization of microbial strains, within the field  ...  : Runs a strain optimization algorithm to identify a set of genes to knockout in order to maximize a given objective function.  ... 
doi:10.1016/j.biosystems.2010.11.012 pmid:21144882 fatcat:3jlmllt2tvcs3pbkn2qx2oykfu

OOPAL

Philippe Mougin, Stéphane Ducasse
2003 SIGPLAN notices  
Array programming shines in its ability to express computations at a high-level of abstraction, allowing one to manipulate and query whole sets of data at once.  ...  The OOPAL model presents a generalization of traditional message passing in the sense that a message can be send to an entire set of objects.  ...  Even though some optimizations are based on optimizing Boolean and number arrays, they are relevant in the specific context of integration of array programming in OOP.  ... 
doi:10.1145/949343.949312 fatcat:iszgqbsl6vgnri46tqhdz463hq

OOPAL

Philippe Mougin, Stéphane Ducasse
2003 Proceedings of the 18th ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications - OOPSLA '03  
Array programming shines in its ability to express computations at a high-level of abstraction, allowing one to manipulate and query whole sets of data at once.  ...  The OOPAL model presents a generalization of traditional message passing in the sense that a message can be send to an entire set of objects.  ...  Even though some optimizations are based on optimizing Boolean and number arrays, they are relevant in the specific context of integration of array programming in OOP.  ... 
doi:10.1145/949305.949312 dblp:conf/oopsla/MouginD03 fatcat:tq372ndwmvfqjfor4du4mldn2u

OOPAL

Philippe Mougin, Stéphane Ducasse
2003 Proceedings of the 18th ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications - OOPSLA '03  
Array programming shines in its ability to express computations at a high-level of abstraction, allowing one to manipulate and query whole sets of data at once.  ...  The OOPAL model presents a generalization of traditional message passing in the sense that a message can be send to an entire set of objects.  ...  Even though some optimizations are based on optimizing Boolean and number arrays, they are relevant in the specific context of integration of array programming in OOP.  ... 
doi:10.1145/949310.949312 fatcat:qlo5dmxfnffl3gu3of3zbz2esm

The Sat4j library, release 2.2

Daniel Le Berre, Anne Parrain
2010 Journal on Satisfiability, Boolean Modeling and Computation  
The Pseudo-Boolean solvers Pseudo-boolean constraints are more expressive and more compact than clauses to represent some boolean formulas.  ...  For instance, it allows the Java programmer to express constraints on objects and hides all the mapping to the various research community input formats from the user.  ... 
doi:10.3233/sat190075 fatcat:nnjdixv4abggli56b4aondmmei

Optimized FPGA Routing using Soft Computing

Ms. Saveena, Vinay Chopra, Amardeep Singh
2010 International Journal of Computer Applications  
This paper presents an ant colony optimization algorithm for geometric FPGA routing for a route based routing constraint model in FPGA design architecture.  ...  In this work we have shown that Ant Colony Optimizations can also be implemented on FPGAs, leading to significant speedups in runtime compared to implementations in software on sequential machines.  ...  In other words, Boolean-based routing is a concurrent method allowing higher degrees of freedom for each object in contrast to the conventional one net-at-a-time approach.  ... 
doi:10.5120/1273-1791 fatcat:jskwammsurefjaluxcelzkz3we
« Previous Showing results 1 — 15 out of 63,901 results