• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 2,292
Next 10 →

Symmetric versions of Laman’s Theorem

by Bernd Schulze - Discrete & Computational Geometry
"... Recent work has shown that if an isostatic bar and joint framework possesses non-trivial symmetries, then it must satisfy some very simply stated restrictions on the number of joints and bars that are ‘fixed ’ by various symmetry operations of the framework. For the group C3 which describes 3-fold r ..."
Abstract - Cited by 19 (5 self) - Add to MetaCart
as possible subject to the given symmetry constraints. In addition, we establish symmetric versions of Henneberg’s Theorem and Crapo’s Theorem for C3 which provide alternate characterizations of ‘generically ’ isostatic graphs with C3 symmetry. As shown in [19], our techniques can be extended to establish

On symmetric versions of Sylvester’s problem

by Mark W. Meckes , 2002
"... Abstract. We consider moments of the normalized volume of a symmetric or nonsymmetric random polytope in a fixed symmetric convex body. We investigate for which bodies these moments are extremized, and calculate exact values in some of the extreme cases. We show that these moments are maximized amon ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. We consider moments of the normalized volume of a symmetric or nonsymmetric random polytope in a fixed symmetric convex body. We investigate for which bodies these moments are extremized, and calculate exact values in some of the extreme cases. We show that these moments are maximized

Applications Of Circumscription To Formalizing Common Sense Knowledge

by John McCarthy - Artificial Intelligence , 1986
"... We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects o ..."
Abstract - Cited by 532 (12 self) - Add to MetaCart
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects

A centrally symmetric version of the cyclic polytope

by Alexander Barvinok, Isabella Novik , 2006
"... We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces in all dimensions among all centrally symmetric polytopes with n vertices of a given even dimension d = 2k when d is fix ..."
Abstract - Cited by 15 (2 self) - Add to MetaCart
We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces in all dimensions among all centrally symmetric polytopes with n vertices of a given even dimension d = 2k when d

Ant Colony System: A cooperative learning approach to the traveling salesman problem

by Marco Dorigo, Luca Maria Gambardella - IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION , 1997
"... This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSP’s. Ants cooperate using an indirect form of communication mediated by a pher ..."
Abstract - Cited by 1029 (53 self) - Add to MetaCart
ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSP’s.

A Symmetric Version Space Algorithm for Learning Disjunctive String Concepts

by Jacky Baltes - In Proc. Fourth UNB Arti�cial Intelligence Symposium , 1992
"... The paper describes an algorithm to learn disjunctive string patterns from examples. An implementation of the ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
The paper describes an algorithm to learn disjunctive string patterns from examples. An implementation of the

A SYMMETRIC VERSION OF KONTSEVICH GRAPH COMPLEX AND LEIBNIZ HOMOLOGY

by Emily Burgunder , 804
"... Abstract. Kontsevich has proven that the Lie homology of the Lie algebra of symplectic vector fields can be computed in terms of the homology of a graph complex. We prove that the Leibniz homology of this Lie algebra can be computed in terms of the homology of a variant of the graph complex endowed ..."
Abstract - Add to MetaCart
with an action of the symmetric groups. The resulting isomorphism is shown to be a Zinbiel-associative bialgebra isomorphism. In his papers [8] and [9], Kontsevich proved that the homology of the Lie algebra sp(Com) of symplectic vector fields on a formal manifold can be computed through graph homology

Modeling Stellar Atmospheres with a Spherically Symmetric Version of the ATLAS Code: Testing the Code by Comparisons to Interferometric

by Hilding R. Neilson, John B. Lester , 808
"... Abstract. One of the current opportunities for stellar atmospheric modeling is the interpretation of optical interferometric data of stars. Starting from the robust, open source ATLAS atmospheric code [1], we have developed a spherically symmetric code, SATLAS, as a new option for modeling stellar a ..."
Abstract - Add to MetaCart
Abstract. One of the current opportunities for stellar atmospheric modeling is the interpretation of optical interferometric data of stars. Starting from the robust, open source ATLAS atmospheric code [1], we have developed a spherically symmetric code, SATLAS, as a new option for modeling stellar

INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, VOL. 7, 316–323 (1997) A Symmetric Version of the McEliece

by Public-key Cryptosystem
"... This article exploits the fact that linear codes can correct twice the number of erasures as that of errors, allowing reduction in code size and providing the same level of security. © 1997 by John ..."
Abstract - Add to MetaCart
This article exploits the fact that linear codes can correct twice the number of erasures as that of errors, allowing reduction in code size and providing the same level of security. © 1997 by John

Previous Up Next Article Citations From References: 2 From Reviews: 1

by Schulze Bernd (d-tub-im, Discrete Comput Geom
"... Symmetric versions of Laman’s theorem. (English summary) ..."
Abstract - Add to MetaCart
Symmetric versions of Laman’s theorem. (English summary)
Next 10 →
Results 1 - 10 of 2,292
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University