Results 1  10
of
397,153
Symbolic Boolean manipulation with ordered binarydecision diagrams
 ACM COMPUTING SURVEYS
, 1992
"... Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as grap ..."
Abstract

Cited by 1035 (13 self)
 Add to MetaCart
Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented
Automatic Subspace Clustering of High Dimensional Data
 Data Mining and Knowledge Discovery
, 2005
"... Data mining applications place special requirements on clustering algorithms including: the ability to find clusters embedded in subspaces of high dimensional data, scalability, enduser comprehensibility of the results, nonpresumption of any canonical data distribution, and insensitivity to the or ..."
Abstract

Cited by 726 (12 self)
 Add to MetaCart
Data mining applications place special requirements on clustering algorithms including: the ability to find clusters embedded in subspaces of high dimensional data, scalability, enduser comprehensibility of the results, nonpresumption of any canonical data distribution, and insensitivity
Nearly Optimal Algorithms For Canonical Matrix Forms
, 1993
"... A Las Vegas type probabilistic algorithm is presented for finding the Frobenius canonical form of an n x n matrix T over any field K. The algorithm requires O~(MM(n)) = MM(n) (log n) ^ O(1) operations in K, where O(MM(n)) operations in K are sufficient to multiply two n x n matrices over K. This nea ..."
Abstract

Cited by 62 (13 self)
 Add to MetaCart
A Las Vegas type probabilistic algorithm is presented for finding the Frobenius canonical form of an n x n matrix T over any field K. The algorithm requires O~(MM(n)) = MM(n) (log n) ^ O(1) operations in K, where O(MM(n)) operations in K are sufficient to multiply two n x n matrices over K
Nonholonomic motion planning: Steering using sinusoids
 IEEE fins. Auto. Control
, 1993
"... AbstractIn this paper, we investigate methods for steering systems with nonholonomic constraints between arbitrary configurations. Early work by Brockett derives the optimal controls for a set of canonical systems in which the tangent space to the configuration manifold is spanned by the input vec ..."
Abstract

Cited by 361 (15 self)
 Add to MetaCart
vector fields and their first order Lie brackets. Using Brockett’s result as motivation, we derive suboptimal trajectories for systems which are not in canonical form and consider systems in which it takes more than one level of bracketing to achieve controllability. These trajectories use sinusoids
A Genetic Algorithm Tutorial
 Statistics and Computing
, 1994
"... This tutorial covers the canonical genetic algorithm as well as more experimental forms of genetic algorithms, including parallel island models and parallel cellular genetic algorithms. The tutorial also illustrates genetic search byhyperplane sampling. The theoretical foundations of genetic algorit ..."
Abstract

Cited by 327 (5 self)
 Add to MetaCart
This tutorial covers the canonical genetic algorithm as well as more experimental forms of genetic algorithms, including parallel island models and parallel cellular genetic algorithms. The tutorial also illustrates genetic search byhyperplane sampling. The theoretical foundations of genetic
Logic Programming in a Fragment of Intuitionistic Linear Logic
, 1994
"... When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ..."
Abstract

Cited by 340 (44 self)
 Add to MetaCart
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ
EXERCISES IN THE BIRATIONAL GEOMETRY OF ALGEBRAIC VARIETIES
, 2008
"... The book [KM98] gave an introduction to the birational geometry of algebraic varieties, as the subject stood in 1998. The developments of the last decade made the more advanced parts of Chapters 6 and 7 less important and the detailed treatment of surface singularities in Chapter 4 less necessary. H ..."
Abstract

Cited by 322 (1 self)
 Add to MetaCart
. However, the main parts, Chapters 1–3 and 5, still form the foundations of the subject. These notes provide additional exercises to [KM98]. The main definitions and theorems are recalled but not proved here. The emphasis is on the many examples that illustrate the methods, their shortcomings and some
of Frobenius
"... A modification of Katzman's example is given to produce a twogenerated ideal in a twodimensional Noetherian integral domain for which the set of associated primes of all the Frobenius powers is infinite. A further modification yields a fourdimensional Noetherian integral domain and a fivedi ..."
Abstract
 Add to MetaCart
A modification of Katzman's example is given to produce a twogenerated ideal in a twodimensional Noetherian integral domain for which the set of associated primes of all the Frobenius powers is infinite. A further modification yields a fourdimensional Noetherian integral domain and a five
Results 1  10
of
397,153