Sciweavers

4052 search results - page 556 / 811
» Using RDF to describe networks
Sort
View
TCS
2008
15 years 6 months ago
Nondeterministic polynomial time factoring in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
Yuriy Brun
AI
2002
Springer
15 years 6 months ago
QUANTUM: A Function-Based Question Answering System
Abstract In this paper, we describe our Question Answering (QA) system called QUANTUM. The goal of QUANTUM is to find the answer to a natural language question in a large document ...
Luc Plamondon, Leila Kosseim
COMCOM
1998
78views more  COMCOM 1998»
15 years 6 months ago
The performance of SQL queries to an X.500 directory system
The X.500 standard speci es a distributed directory service designed to store information about people and objects associated with computer networks. Its API is geared toward retr...
David Barrowman, Patrick Martin
JAIR
2002
120views more  JAIR 2002»
15 years 6 months ago
Learning Geometrically-Constrained Hidden Markov Models for Robot Navigation: Bridging the Topological-Geometrical Gap
Hidden Markov models hmms and partially observable Markov decision processes pomdps provide useful tools for modeling dynamical systems. They are particularly useful for represent...
Hagit Shatkay, Leslie Pack Kaelbling
ISCI
1998
193views more  ISCI 1998»
15 years 6 months ago
A Parallel Implementation of Genetic Programming that Achieves Super-Linear Performance
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
David Andre, John R. Koza