• 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 25,607
Next 10 →

Tractable reasoning and efficient query answering in description logics: The DL-Lite family

by Diego Calvanese, G. De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati - J. OF AUTOMATED REASONING , 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract - Cited by 497 (123 self) - Add to MetaCart
We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base

Flocks, herds, and schools: a distributed behavior model,

by Craig W Reynolds - Proceedings of ACM SIGGRAPH , 1987
"... Abstract The aggregate motion of a flock of birds, a herd of land animals, or a school of fish is a beautiful and familiar part of the natural world. But this type of complex motion is rarely seen in computer animation. This paper explores an approach based on simulation as an alternative to script ..."
Abstract - Cited by 1317 (5 self) - Add to MetaCart
to scripting the paths of each bird individually. The simulated flock is an elaboration of a particle system, with the simulated birds being the particles. The aggregate motion of the simulated flock is created by a distributed behavioral model much like that at work in a natural flock; the birds choose

Large steps in cloth simulation

by David Baraff, Andrew Witkin - SIGGRAPH 98 Conference Proceedings , 1998
"... The bottle-neck in most cloth simulation systems is that time steps must be small to avoid numerical instability. This paper describes a cloth simulation system that can stably take large time steps. The simulation system couples a new technique for enforcing constraints on individual cloth particle ..."
Abstract - Cited by 576 (5 self) - Add to MetaCart
The bottle-neck in most cloth simulation systems is that time steps must be small to avoid numerical instability. This paper describes a cloth simulation system that can stably take large time steps. The simulation system couples a new technique for enforcing constraints on individual cloth

Diagnosing multiple faults.

by Johan De Kleer , Brian C Williams - Artificial Intelligence, , 1987
"... Abstract Diagnostic tasks require determining the differences between a model of an artifact and the artifact itself. The differences between the manifested behavior of the artifact and the predicted behavior of the model guide the search for the differences between the artifact and its model. The ..."
Abstract - Cited by 808 (62 self) - Add to MetaCart
. The diagnostic procedure presented in this paper is model-based, inferring the behavior of the composite device from knowledge of the structure and function of the individual components comprising the device. The system (GDE -General Diagnostic Engine) has been implemented and tested on many examples

The particel swarm: Explosion, stability, and convergence in a multi-dimensional complex space

by Maurice Clerc, James Kennedy - IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTION
"... The particle swarm is an algorithm for finding optimal regions of complex search spaces through interaction of individuals in a population of particles. Though the algorithm, which is based on a metaphor of social interaction, has been shown to perform well, researchers have not adequately explained ..."
Abstract - Cited by 852 (10 self) - Add to MetaCart
The particle swarm is an algorithm for finding optimal regions of complex search spaces through interaction of individuals in a population of particles. Though the algorithm, which is based on a metaphor of social interaction, has been shown to perform well, researchers have not adequately

Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,

by ] Richard Hackman , Grec R Oldham , 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract - Cited by 622 (2 self) - Add to MetaCart
for the results of the work he or she does; MOTIVATION THROUGH DESIGN OF WORK 257 Knowledge of Results. The degree to which the individual knows and understands, on a continuous basis, how effectively he or she is performing the job. Job Dimensions Of the five characteristics of jobs shown in

A statistical interpretation of term specificity and its application in retrieval

by Karen Spärck Jones - Journal of Documentation , 1972
"... Abstract: The exhaustivity of document descriptions and the specificity of index terms are usually regarded as independent. It is suggested that specificity should be interpreted statistically, as a function of term use rather than of term meaning. The effects on retrieval of variations in term spec ..."
Abstract - Cited by 589 (3 self) - Add to MetaCart
descriptions, and specificity one of index terms. They are most clearly illustrated by a simple keyword or descriptor system. In this case the exhaustivity of a document description is the coverage of its various topics given by the terms assigned to it; and the specificity of an individual term is the level

Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach

by Eckart Zitzler, Lothar Thiele - IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION , 1999
"... Evolutionary algorithms (EA’s) are often well-suited for optimization problems involving several, often conflicting objectives. Since 1985, various evolutionary approaches to multiobjective optimization have been developed that are capable of searching for multiple solutions concurrently in a singl ..."
Abstract - Cited by 813 (22 self) - Add to MetaCart
. The proof-of-principle results obtained on two artificial problems as well as a larger problem, the synthesis of a digital hardware–software multiprocessor system, suggest that SPEA can be very effective in sampling from along the entire Pareto-optimal front and distributing the generated solutions over

lmbench: Portable Tools for Performance Analysis

by Carl Staelin, Hewlett-packard Laboratories - In USENIX Annual Technical Conference , 1996
"... lmbench: Portable tools for performance analysis lmbench is a micro-benchmark suite designed to focus attention on the basic building blocks of many common system applications, such as databases, simulations, software development, and networking. In almost all cases, the individual tests are the res ..."
Abstract - Cited by 464 (2 self) - Add to MetaCart
lmbench: Portable tools for performance analysis lmbench is a micro-benchmark suite designed to focus attention on the basic building blocks of many common system applications, such as databases, simulations, software development, and networking. In almost all cases, the individual tests

COMA - A system for flexible combination of Schema Matching Approaches

by Hong-hai Do, Erhard Rahm - In VLDB , 2002
"... Schema matching is the task of finding semantic correspondences between elements of two schemas. It is needed in many database applications, such as integration of web data sources, data warehouse loading and XML message mapping. To reduce the amount of user effort as much as possible, automati ..."
Abstract - Cited by 443 (12 self) - Add to MetaCart
to combine multiple matchers in a flexible way. We provide a large spectrum of individual matchers, in particular a novel approach aiming at reusing results from previous match operations, and several mechanisms to combine the results of matcher executions. We use COMA as a framework to com
Next 10 →
Results 1 - 10 of 25,607
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