A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Filters
Sequential Decision Making Algorithms for Port of Entry Inspection: Overcoming Computational Challenges
2007
2007 IEEE Intelligence and Security Informatics
Preserved Fulltext
Following work of Stroud and Saeger [2] and Anand et al. [1], we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean ...
We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and a novel binary decision tree search algorithm that operates on ...
We also thank Richard Mammone for many of the initial ideas that led to this research. ...
doi:10.1109/isi.2007.379521
dblp:conf/isi/MadiganMR07
fatcat:a6wgs7b5brf4lo6o3xnsejnuwi
Abstracts of Current Computer Literature
1969
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
for Cataloguing
Boolean Functions into Discrete Classes
6897
Classification of Sequential Machines in
Terms of Algebraic Structure 6907
Codes
Code Distance of Two Arguments of a
Boolean Function ...
of Combinational
Switching Functions 6898
Optimal Procedure for Selecting Diagnos-
tic Tests for Combinational Circuits
6899
Compilers
Optimization of Compilers and Executive
Systems Using Boolean ...
doi:10.1109/t-c.1969.222770
fatcat:3u7q7ac3b5hx5fdffcemcrpsay
Symbolic Boolean manipulation with ordered binary-decision diagrams
1992
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
First, the possible variations in system parameters and operating conditions are encoded with Boolean variables. Then the system is evaluated for all variations by a sequence of OBDD operations. ...
A number of operations on Boolean functions can be implemented as graph algorithms on OBDD data structures. Using OBDDs, a wide variety of problems can be solved through symbolic analysis. ...
Tree Representations of a Boolean Function. ...
doi:10.1145/136035.136043
fatcat:o747kjvslng2bpzvyisp7utefu
Multiobjective Optimization of a Port-of-Entry Inspection Policy
2010
IEEE Transactions on Automation Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In this paper we consider a system operating with a Boolean decision function combining station results and present a multi-objective optimization approach to determine the optimal sensor arrangement and ...
At the port-of-entry containers are inspected through a specific sequence of sensor stations to detect the presence of nuclear materials, biological and chemical agents, and other illegal cargo. ...
ACKNOWLEDGMENT This research is conducted with partial support from Office of Naval Research grant numbers N00014-05-1-0237, N00014-07-1-029 and National Science Foundation grant number NSFSES 05-18543 ...
doi:10.1109/tase.2009.2022172
fatcat:4a4dp76325bznfi4v7fxiw43fq
Abstracts of Current Computer Literature
1968
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
needed to realize the Boolean function and the min En= 1 wi I. ...
Using the scaling graph, optimal scales are obtained simply, by constructing a maximum distance tree. ...
doi:10.1109/tc.1968.227415
fatcat:gww3av6fqncynbg6czmzjuomxi
Design of a More Efficient and Effective Flip Flop use of K-Map Based Boolean Function
2016
International Journal of Science and Research (IJSR)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Our method combines an R-tree with an inverted index by the inclusion of spatial references in posting lists. ...
A node entry is placed in the priority queue if there exists at least one object that satisfies the Boolean condition in the sub tree pointed by the entry; otherwise, the Sub tree is not further explored ...
Bryant, Graph-Based Algorithms For Boolean Function Manipulation, 2008, in this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms ...
doi:10.21275/v5i4.nov162979
fatcat:fil4tbstz5dozolrsnsg6nuib4
Query processing and optimization in Oracle Rdb
1996
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper contains an overview of the technology used in the query processing and optimization component of Oracle Rdb, a relational database management system originally developed by Digital Equipment ...
Oracle Rdb is a production system that supports the most demanding database applications, runs on multiple platforms and in a variety of environments. ...
Note that NULL value treatment in this arrangement should be the opposite to the way it is done in regular boolean evaluation. ...
doi:10.1007/s007780050026
fatcat:it56qwgzprestnotilpxym2ium
Compiling regular patterns
2003
Proceedings of the eighth ACM SIGPLAN international conference on Functional programming - ICFP '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A compiler for such a language must address not only the familiar problems of pattern optimization for ML-style algebraic datatypes and pattern matching, but also some new ones, arising principally from ...
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing treestructured data such as XML. ...
Washburn, Stephen Tse, Haruo Hosoya, Ralf Hinze, and the ICFP reviewers for reading this paper and suggesting numerous improvements. ...
doi:10.1145/944705.944712
dblp:conf/icfp/Levin03
fatcat:f4yopp42ofd4lfbftzr7bgv7wa
Compiling regular patterns
2003
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A compiler for such a language must address not only the familiar problems of pattern optimization for ML-style algebraic datatypes and pattern matching, but also some new ones, arising principally from ...
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing treestructured data such as XML. ...
Washburn, Stephen Tse, Haruo Hosoya, Ralf Hinze, and the ICFP reviewers for reading this paper and suggesting numerous improvements. ...
doi:10.1145/944746.944712
fatcat:axiipmbsn5aedefiwxjnaeqxyu
Page 6947 of Mathematical Reviews Vol. , Issue 95k
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
However, for single output Boolean functions, nontrivial tradeoff results of this type have been established only for restricted classes of branching programs. ...
Assuming the levels of nesting of each parenthesis are given, we present an algorithm that runs in O(a(n)) time using an optimal number of proces- sors (where a(n) is the inverse of Ackermann’s function ...
Sweep Methods for Parallel Computational Geometry
1996
Algorithmica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
For example, we give an optimal parallel method for building a data structure for line-stabbing queries (which, incidentally, improves the sequential complexity of this problem). ...
contour of a collection of rectangles. 9 Hidden-surface elimination for rectangles. ...
The main idea is to build the arrangement, an operation sequence for that arrangement, use the array-of-trees data structure to evaluate the sequence, and then perform queries for this sequence to solve ...
doi:10.1007/s004539900008
fatcat:cro7bvgsvbarvmsnkczdkvvryi
Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
formula between Boolean terms made by zeros and ones; and, finally, by evaluating this expression using bitwise operators. ...
We put forth a novel algebraic technique to evaluate any variadic expression between polyhedral d-solids (d = 2, 3) with regularized operators of union, intersection, and difference, i.e., any CSG tree ...
Antonio Bottaro believed in this project and funded its development as responsible of R&D of Sogei (Italian Ministry of Economy and Finance) and CEO of the Geoweb subsidiary. ...
arXiv:1910.11848v3
fatcat:3okqlmuh2ncihjq2ha2vvk3ikm
Efficient sequential decision-making algorithms for container inspection operations
2011
Naval Research Logistics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Boolean decision function. ...
We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on ...
They also thank Richard Mammone for many of the initial ideas that led to this research. ...
doi:10.1002/nav.20472
fatcat:634xygh35ffvzbgxoeqwuz7ezm
Volumetric Procedural Models for Shape Representation
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
PSML also provides a number of new language-specific capabilities that allow for a rich variety of context-sensitive behaviors and post-processing functions. ...
Boolean operations on the model parts. ...
Since these functions are available to sequential code logic, users can use PSML to construct shape optimization programs which search the space of shapes described by the PSML program (sometimes called ...
arXiv:2103.11930v1
fatcat:d7dy5kicqjfznhi3qtefhswtky
Integrated Methodology for Software Reliability Analysis
2012
Informatică economică
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The present paper describes the applicability of fault trees analysis software system, analysis defined as Software Fault Tree Analysis (SFTA), fault trees are evaluated using binary decision diagrams, ...
all of these being integrated and used with help from Java library reliability. ...
for Code Generation and Software Optimization. ...
doaj:17c2d771a87646739dd1795dccc67aea
fatcat:zcrm3ok2u5hgdg2n4pn2pb23ti
« Previous
Showing results 1 — 15 out of 4,922 results