• 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 4,877
Next 10 →

UPDATABLE STRATEGY LOGIC

by Christophe Chareton, Julien Brunel, David Chemouil , 2013
"... Abstract. In this article, we present Updatable Strategy Logic (USL), a multi-agent temporal logic which subsumes the main propositions in this area, such as ATL-ATL*, ATLsc and SL. These logics allow to express the capabilities of agents to ensure the satisfaction of temporal properties. USL mainly ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. In this article, we present Updatable Strategy Logic (USL), a multi-agent temporal logic which subsumes the main propositions in this area, such as ATL-ATL*, ATLsc and SL. These logics allow to express the capabilities of agents to ensure the satisfaction of temporal properties. USL

Towards an Updatable Strategy Logic

by Christophe Chareton, Julien Brunel, David Chemouil
"... This article is about temporal multi-agent logics. Several of these formalisms have been already presented (ATL-ATL*, ATLsc, SL). They enable to express the capabilities of agents in a system to ensure the satisfaction of temporal properties. Particularly, SL and ATLsc enable several agents to inter ..."
Abstract - Add to MetaCart
to interact in a context mixing the different strategies they play in a semantical game. We generalize this possibility by proposing a new formalism, Updating Strategy Logic (USL). In USL, an agent can also refine its own strategy. The gain in expressive power rises the notion of sustainable capabilities

Update Strategies for DBpedia Live

by Claus Stadler, Michael Martin, Jens Lehmann, Sebastian Hellmann
"... Abstract. Wikipedia is one of the largest public information spaces with a huge user community, which collaboratively works on the largest online encyclopedia. Their users add or edit up to 150 thousand wiki pages per day. The DBpedia project extracts RDF from Wikipedia and interlinks it with other ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
knowledge bases. In the DBpedia live extraction mode, Wikipedia edits are instantly processed to update information in DBpedia. Due to the high number of edits and the growth of Wikipedia, the update process has to be very efficient and scalable. In this paper, we present different strategies to tackle

On the Robustness of Update Strategies for the Bayesian

by Hyperparameter Α , 2001
"... Many practical realizations of Bayesian Regulariza-tion perform an update of the hyperparameters α and β after each training cycle. However, the most popular update algorithm fails to produce robust iterates if there is not much training data. This behavior is being studied and compared to an al-ter ..."
Abstract - Add to MetaCart
Many practical realizations of Bayesian Regulariza-tion perform an update of the hyperparameters α and β after each training cycle. However, the most popular update algorithm fails to produce robust iterates if there is not much training data. This behavior is being studied and compared to an al

Update Strategies for DBpedia Live

by unknown authors
"... Abstract. Wikipedia is one of the largest public information spaces with a huge user community, which collaboratively works on the largest online encyclopedia. Their users add or edit up to 150 thousand wiki pages per day. The DBpedia project extracts RDF from Wikipedia and interlinks it with other ..."
Abstract - Add to MetaCart
knowledge bases. In the DBpedia live extraction mode, Wikipedia edits are instantly processed to update information in DBpedia. Due to the high number of edits and the growth of Wikipedia, the update process has to be very efficient and scalable. In this paper, we present different strategies to tackle

A New Extension of the Kalman Filter to Nonlinear Systems

by Simon J. Julier, Jeffrey K. Uhlmann , 1997
"... The Kalman filter(KF) is one of the most widely used methods for tracking and estimation due to its simplicity, optimality, tractability and robustness. However, the application of the KF to nonlinear systems can be difficult. The most common approach is to use the Extended Kalman Filter (EKF) which ..."
Abstract - Cited by 778 (6 self) - Add to MetaCart
) which simply linearises all nonlinear models so that the traditional linear Kalman filter can be applied. Although the EKF (in its many forms) is a widely used filtering strategy, over thirty years of experience with it has led to a general consensus within the tracking and control community

Update strategies for perturbed nonsmooth equations

by Roland Griesse, Thomas Grund, Daniel Wachsmuth - Optimization Methods and Software
"... Abstract. Nonsmooth operator equations in function spaces are considered, which depend on perturbation parameters. The nonsmoothness arises from a projection onto an admissible interval. Lipschitz stability in L ∞ and Bouligand differentiability in L p of the parameter-to-solution map are derived. A ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
. An adjoint problem is introduced for which Lipschitz stability and Bouligand differentiability in L ∞ are obtained. Three different update strategies, which recover a perturbed from an unperturbed solution, are analyzed. They are based on Taylor expansions of the primal and adjoint variables, where

A local update strategy for iterative reconstruction from projections

by Ken Sauer, Charles Bouman - IEEE Tr. Sig. Proc , 1993
"... Iterative methods for statistically-based reconstruction from projections are computationally costly relative to convolution backprojection, but allow useful image reconstruction from sparse and noisy data. We present a method for Bayesian reconstruction which relies on updates of single pixel value ..."
Abstract - Cited by 153 (34 self) - Add to MetaCart
Iterative methods for statistically-based reconstruction from projections are computationally costly relative to convolution backprojection, but allow useful image reconstruction from sparse and noisy data. We present a method for Bayesian reconstruction which relies on updates of single pixel

Uniqueness of update strategies for database views,” in

by Stephen J. Hegner - Foundations of Information and Knowledge Systems: Second International Symposium, FoIKS 2002, Salzau
"... Abstract. The problem of supporting updates to views of a database schema has been the focus of a substantial amount of research over the years. Since the mapping from base schema to view schema is seldom injective, there is usually a choice of possibilities for the reflection of view updates to bas ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
to base-schema updates. This work presents a solution to this problem which augments the constant-complement strategy of Bancilhon and Spyratos with order-theoretic properties to guarantee unique reflection of view updates. Specifically, most database formalisms endow the database states with a natural

Automatic Selection of an Update Strategy for Management Data

by Ernö Kovács - In Proceedings of the IEEE First International Workshop on Systems Management (IWSM’93 , 1993
"... Systems management operations are based on data that is distributed throughout the network. Monitoring this information requires network messages and can increase network traffic significantly. Selecting the right update strategy for such continuous management activities reduces the network load. Au ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Systems management operations are based on data that is distributed throughout the network. Monitoring this information requires network messages and can increase network traffic significantly. Selecting the right update strategy for such continuous management activities reduces the network load
Next 10 →
Results 1 - 10 of 4,877
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