• 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 11 - 20 of 4,340
Next 10 →

Pareto Frontier Construction. A GA vs Gauss-Newton Optimization for Normalized Normal Constraint Method

by Miguel Martínez, Sergio García-nieto
"... Abstract — Important efforts have been made in the last years to develop methods for the construction of Pareto frontiers that guarantee uniform distribution and that exclude the non Pareto and local Pareto points. Nevertheless, these methods are susceptible of improvement or modifications to reach ..."
Abstract - Add to MetaCart
the same level of results more efficiently. This paper presents GA optimization as alternative for Normalized Normal Constraint method. Moreover a compare between Gauss-Newton and GA methods is presented. The results presented in this paper show the suitable behavior of the GA method compared to classical

Algorithms for Distributed Constraint Satisfaction: A Review

by Makoto Yokoo, Katsutoshi Hirayama - In CP , 2000
"... . When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints. Vario ..."
Abstract - Cited by 250 (11 self) - Add to MetaCart
. When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints

Efficient Simulation from the Multivariate Normal and Student-t Distributions Subject to Linear Constraints and the Evaluation of Constraint Probabilities

by John Geweke , 1991
"... The construction and implementation of a Gibbs sampler for efficient simulation from the truncated multivariate normal and Student-t distributions is described. It is shown how the accuracy and convergence of integrals based on the Gibbs sample may be constructed, and how an estimate of the probabil ..."
Abstract - Cited by 211 (10 self) - Add to MetaCart
of the probability of the constraint set under the unrestricted distribution may be produced. Keywords: Bayesian inference; Gibbs sampler; Monte Carlo; multiple integration; truncated normal This paper was prepared for a presentation at the meeting Computing Science and Statistics: the Twenty-Third Symposium

A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems

by Marlene Arangú, Miguel A. Salido - International Journal of Applied Mathematics and Computer Science 21(4): 733–744, DOI , 2011
"... Constraint programming is a powerful software technology for solving numerous real-life problems. Many of these problems can be modeled as Constraint Satisfaction Problems (CSPs) and solved using constraint programming techniques. However, solving a CSP is NP-complete so filtering techniques to redu ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
lot of checks and time. In this paper, we present AC4-OP, an optimized version of AC4 that manages the binary and non-normalized constraints in only one direction, storing the inverse founded supports for their later evaluation. Thus, it reduces the propagation phase avoiding unnecessary

Semistructured data

by Peter Buneman , 1997
"... In semistructured data, the information that is normally as-sociated with a schema is contained within the data, which is sometimes called “self-describing”. In some forms of semi-structured data there is no separate schema, in others it exists but only places loose constraints on the data. Semi-str ..."
Abstract - Cited by 281 (0 self) - Add to MetaCart
In semistructured data, the information that is normally as-sociated with a schema is contained within the data, which is sometimes called “self-describing”. In some forms of semi-structured data there is no separate schema, in others it exists but only places loose constraints on the data. Semi

Circumvention of Normal Constraints on Granule Protein Gene Expression in Peripheral Blood Neutrophils and Monocytes of Patients with Antineutrophil Cytoplasmic

by Jia Jin Yang, William F. Pendergraft, David A. Alcorta, Patrick H. Nachman, Susan L. Hogan, Robin P. Thomas, Pamela Sullivan, J. Charles Jennette, Ronald J. Falk, Gloria A. Preston
"... Abstract. Granulopoiesis-related genes are distinctively upregulated in peripheral leukocytes of patients with antineutrophil cytoplasmic autoantibodies (ANCA)-associated glomerulonephritis. Affymetrix microarrays identified the upregulation of nine neutrophilic primary granule genes, including myel ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. Granulopoiesis-related genes are distinctively upregulated in peripheral leukocytes of patients with antineutrophil cytoplasmic autoantibodies (ANCA)-associated glomerulonephritis. Affymetrix microarrays identified the upregulation of nine neutrophilic primary granule genes, including myeloperoxidase (MPO) and proteinase 3 (PR3), plus five secondary granule genes. Coordinate expression of granulocyte maturation marker CD35, measured by TaqMan PCR, and positive in situ staining for PR3 transcripts in polymorphic neutrophils and monocytes indicate that these genes are expressed in “mature ” cells. Increased transcripts correlated with disease activity and absolute neutrophil values but not with “left shift,” drug regimen, cytokine levels, hematuria, proteinuria, ANCA titer, serum creatinine, gender, or age. Upregulation of PR3 and MPO transcripts was specifically associated with ANCA disease

ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers

by Fangzhen Lin, Yuting Zhao - Artificial Intelligence , 2002
"... We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a one-to-one corresp ..."
Abstract - Cited by 260 (7 self) - Add to MetaCart
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a one

Graph embedding and extension: A general framework for dimensionality reduction

by Shuicheng Yan, Dong Xu, Benyu Zhang, Hong-jiang Zhang, Qiang Yang, Stephen Lin - IEEE TRANS. PATTERN ANAL. MACH. INTELL , 2007
"... Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different solutions to the problem of dimensionality reduction. Despite the different motivations of these algorithms, we present in this paper ..."
Abstract - Cited by 271 (29 self) - Add to MetaCart
properties of a data set, with constraints from scale normalization or a penalty graph that characterizes a statistical or geometric property that should be avoided. Furthermore, the graph embedding framework can be used as a general platform for developing new dimensionality reduction algorithms

Dual Contouring of Hermite Data

by Tao Ju, Frank Losasso, Scott Schaefer, Joe Warren , 2002
"... This paper describes a new method for contouring a signed grid whose edges are tagged by Hermite data (exact intersection points and normals). This method avoids the need to explicitly identify and process "features" as required in previous Hermite contouring methods. We extend this contou ..."
Abstract - Cited by 258 (15 self) - Add to MetaCart
This paper describes a new method for contouring a signed grid whose edges are tagged by Hermite data (exact intersection points and normals). This method avoids the need to explicitly identify and process "features" as required in previous Hermite contouring methods. We extend

Autocalibration and the absolute quadric

by Bill Triggs - in Proc. IEEE Conf. Computer Vision, Pattern Recognition , 1997
"... We describe a new method for camera autocalibration and scaled Euclidean structure and motion, from three or more views taken by a moving camera with fixed but unknown intrinsic parameters. The motion constancy of these is used to rectify an initial projective reconstruction. Euclidean scene structu ..."
Abstract - Cited by 248 (7 self) - Add to MetaCart
structure is formulated in terms of the absolute quadric — the singular dual 3D quadric ( rank 3 matrix) giving the Euclidean dot-product between plane normals. This is equivalent to the traditional absolute conic but simpler to use. It encodes both affine and Euclidean structure, and projects very simply
Next 10 →
Results 11 - 20 of 4,340
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