Sciweavers

1368 search results - page 213 / 274
» Generalized Rook Polynomials
Sort
View
UAI
2000
15 years 7 months ago
PEGASUS: A policy search method for large MDPs and POMDPs
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
Andrew Y. Ng, Michael I. Jordan
AAAI
1996
15 years 7 months ago
A Connectionist Framework for Reasoning: Reasoning with Examples
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries...
Dan Roth
IJCAI
1993
15 years 7 months ago
A Tractable Class of Abduction Problems
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
Kave Eshghi
ISMB
1994
15 years 7 months ago
Kinematic Manipulation of Molecular Chains Subject to Rigid Constraint
Wepresent algorithms for kinematic manipulation of molecular chains subject to fixed bond lengths and bond angles. They are useful for calculating conformations of a molecule subj...
Dinesh Manocha, Yunshan Zhu
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
15 years 7 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons