Sciweavers

664 search results - page 103 / 133
» The tree Constraint
Sort
View
AIPS
2006
13 years 9 months ago
On Some Tractable Cases of Logical Filtering
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
T. K. Satish Kumar, Stuart J. Russell
ACL
1998
13 years 9 months ago
PAT-Trees with the Deletion Function as the Learning Device for Linguistic Patterns
In this study, a learning device based on the PATtree data structures was developed. The original PAT-trees were enhanced with the deletion function to emulate human learning comp...
Keh-Jiann Chen, Wen Tsuei, Lee-Feng Chien
AIPS
2009
13 years 8 months ago
Dynamic Controllability of Temporally-flexible Reactive Programs
In this paper we extend dynamic controllability of temporally-flexible plans to temporally-flexible reactive programs. We consider three reactive programming language constructs w...
Robert T. Effinger, Brian C. Williams, Gerard Kell...
JPDC
2006
187views more  JPDC 2006»
13 years 7 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
JDA
2007
156views more  JDA 2007»
13 years 7 months ago
A linear time algorithm for the inversion median problem in circular bacterial genomes
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathri...