Results 1  10
of
435,788
Using Problem Symmetry in Search Based Satisfiability Algorithms
 In Proceedings of the conference on Design, Automation, and Test in Europe
, 2002
"... We introduce the notion of problem symmetry in searchbased SAT algorithms. We develop a theory of essential points to formally characterize the potential searchspace pruning that can be realized by exploiting problem symmetry. We unify several searchpruning techniques used in modern SAT solvers un ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We introduce the notion of problem symmetry in searchbased SAT algorithms. We develop a theory of essential points to formally characterize the potential searchspace pruning that can be realized by exploiting problem symmetry. We unify several searchpruning techniques used in modern SAT solvers
Closedform solution of absolute orientation using unit quaternions
 J. Opt. Soc. Am. A
, 1987
"... Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. I present here a closedform solution to the leastsquares pr ..."
Abstract

Cited by 990 (4 self)
 Add to MetaCart
squares problem for three or more points. Currently various empirical, graphical, and numerical iterative methods are in use. Derivation of the solution is simplified by use of unit quaternions to represent rotation. I emphasize a symmetry property that a solution to this problem ought to possess. The best
An almost ideal demand system.
 American Economic Review,
, 1980
"... Ever since Richard Stone (1954) first estimated a system of demand equations derived explicitly from consumer theory, there has been a continuing search for alternative specifications and functional forms. Many models have been proposed, but perhaps the most important in current use, apart from the ..."
Abstract

Cited by 633 (0 self)
 Add to MetaCart
and symmetry restrictions. Our results are consistent with earlier findings in that both sets of restrictions are decisively rejected. We also find that imposition of homogeneity generates positive serial correlation in the errors of those equations which reject the restrictions most strongly; this suggests
Exploiting Problem Symmetries in StateBased Planners
, 2011
"... Previous research in Artificial Intelligence has identified the possibility of simplifying planning problems via the identification and exploitation of symmetries. We advance the state of the art in algorithms that exploit symmetry in planning problems by generalizing previous approaches, and applyi ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Previous research in Artificial Intelligence has identified the possibility of simplifying planning problems via the identification and exploitation of symmetries. We advance the state of the art in algorithms that exploit symmetry in planning problems by generalizing previous approaches
NONLINEAR SCHRÖDINGER PROBLEMS: SYMMETRIES OF SOME VARIATIONAL SOLUTIONS
"... ABSTRACT. In this paper, we are interested in the nonlinear Schrödinger problem −∆u+ Vu = up−2u submitted to the Dirichlet boundary conditions. We consider p> 2 and we are working with an open bounded domain Ω ⊆ RN (N ≥ 2). Potential V satisfies max(V,0) ∈ LN/2(Ω) and min(V,0) ∈ L+∞(Ω). Moreo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ABSTRACT. In this paper, we are interested in the nonlinear Schrödinger problem −∆u+ Vu = up−2u submitted to the Dirichlet boundary conditions. We consider p> 2 and we are working with an open bounded domain Ω ⊆ RN (N ≥ 2). Potential V satisfies max(V,0) ∈ LN/2(Ω) and min(V,0) ∈ L
Branchandprice: Column generation for solving huge integer programs
 OPER. RES
, 1998
"... We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branchandbound tree. We present classes of models for which t ..."
Abstract

Cited by 360 (13 self)
 Add to MetaCart
this approach decomposes the problem, provides tighter LP relaxations, and eliminates symmetry. We then discuss computational issues and implementation of column generation, branchandbound algorithms, including special branching rules and efficient ways to solve the LP relaxation. We also discuss
SymmetryBreaking Predicates for Search Problems
, 1996
"... Many reasoning and optimization problems exhibit symmetries. Previous work has shown how special purpose algorithms can make use of these symmetries to simplify reasoning. We present a general scheme whereby symmetries are exploited by adding "symmetrybreaking" predicates to the the ..."
Abstract

Cited by 198 (1 self)
 Add to MetaCart
Many reasoning and optimization problems exhibit symmetries. Previous work has shown how special purpose algorithms can make use of these symmetries to simplify reasoning. We present a general scheme whereby symmetries are exploited by adding "symmetrybreaking" predicates
Computing Discrete Minimal Surfaces and Their Conjugates
 EXPERIMENTAL MATHEMATICS
, 1993
"... We present a new algorithm to compute stable discrete minimal surfaces bounded by a number of fixed or free boundary curves in R³, S³ and H³. The algorithm makes no restriction on the genus and can handle singular triangulations. For a discrete harmonic map a conjugation process is presented leading ..."
Abstract

Cited by 347 (10 self)
 Add to MetaCart
leading in case of minimal surfaces additionally to instable solutions of the free boundary value problem for minimal surfaces. Symmetry properties of boundary curves are respected during conjugation.
Better Verification Through Symmetry
, 1996
"... A fundamental difficulty in automatic formal verification of finitestate systems is the state explosion problem  even relatively simple systems can produce very large state spaces, causing great difficulties for methods that rely on explicit state enumeration. We address the problem by exploiting ..."
Abstract

Cited by 221 (8 self)
 Add to MetaCart
A fundamental difficulty in automatic formal verification of finitestate systems is the state explosion problem  even relatively simple systems can produce very large state spaces, causing great difficulties for methods that rely on explicit state enumeration. We address the problem
The AdS5 × S 5 superstring worldsheet Smatrix and crossing symmetry
, 2008
"... An Smatrix satisying the YangBaxter equation with symmetries relevant to the AdS5 × S 5 superstring has recently been determined up to an unknown scalar factor. Such scalar factors are typically fixed using crossing relations, however due to the lack of conventional relativistic invariance, in thi ..."
Abstract

Cited by 228 (6 self)
 Add to MetaCart
An Smatrix satisying the YangBaxter equation with symmetries relevant to the AdS5 × S 5 superstring has recently been determined up to an unknown scalar factor. Such scalar factors are typically fixed using crossing relations, however due to the lack of conventional relativistic invariance
Results 1  10
of
435,788