Sciweavers

62 search results - page 6 / 13
» Branch Cuts in Computer Algebra
Sort
View
FUIN
2006
103views more  FUIN 2006»
13 years 11 months ago
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully be...
Pascal Hitzler, Markus Krötzsch, Guo-Qiang Zh...
BIRTHDAY
2005
Springer
14 years 4 months ago
Finite Equational Bases in Process Algebra: Results and Open Questions
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
ANOR
2005
131views more  ANOR 2005»
13 years 10 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
AAAI
2006
14 years 9 days ago
Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT
Many lower bound computation methods for branch and bound Max-SAT solvers can be explained as procedures that search for disjoint inconsistent subformulas in the Max-SAT instance ...
Chu Min Li, Felip Manyà, Jordi Planes
FSTTCS
2009
Springer
14 years 5 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...