Sciweavers

3737 search results - page 306 / 748
» Knowledge Management and Promises
Sort
View
IJCAI
2007
15 years 8 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
IJCAI
1989
15 years 8 months ago
Preprocessing Search Spaces for Branch and Bound Search
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
Qiang Yang, Dana S. Nau
ICANN
2010
Springer
15 years 7 months ago
Exploring Continuous Action Spaces with Diffusion Trees for Reinforcement Learning
We propose a new approach for reinforcement learning in problems with continuous actions. Actions are sampled by means of a diffusion tree, which generates samples in the continuou...
Christian Vollmer, Erik Schaffernicht, Horst-Micha...
TASLP
2008
134views more  TASLP 2008»
15 years 6 months ago
Semantic Role Labeling Using a Grammar-Driven Convolution Tree Kernel
Convolution tree kernel has shown promising results in semantic role labeling (SRL). However, this kernel does not consider much linguistic knowledge in kernel design and only perf...
Min Zhang, Wanxiang Che, Guodong Zhou, AiTi Aw, Ch...
IJBRA
2010
116views more  IJBRA 2010»
15 years 5 months ago
Scaling alignment of large ontologies
: In recent years, the number of ontologies shared on the Web has increased dramatically, supporting a growing set of applications such as biological knowledge sharing, enhanced se...
Suzette Stoutenburg, Jugal Kalita, Kaily Ewing, Li...