Sciweavers

394 search results - page 53 / 79
» Computing Minimal Polynomials of Matrices
Sort
View
163
Voted
AI
2005
Springer
15 years 6 months ago
Knowledge updates: Semantics and complexity issues
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
Chitta Baral, Yan Zhang
151
Voted
ICSOC
2007
Springer
16 years 17 days ago
Execution Optimization for Composite Services Through Multiple Engines
Web services are rapidly emerging as a popular standard for sharing data and functionality among heterogeneous systems. We propose a general purpose Web Service Management System (...
Wubin Li, Zhuofeng Zhao, Jun Fang, Kun Chen
IJCAI
2003
15 years 7 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
ICPP
2005
IEEE
16 years 17 hour ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
JCB
1998
105views more  JCB 1998»
15 years 6 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou