Sciweavers

2181 search results - page 48 / 437
» The restriction scaffold problem
Sort
View
ICMLA
2004
13 years 10 months ago
Satisficing Q-learning: efficient learning in problems with dichotomous attributes
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...
Michael A. Goodrich, Morgan Quigley
JNS
2008
55views more  JNS 2008»
13 years 8 months ago
Interaction of Two Charges in a Uniform Magnetic Field: II. Spatial Problem
The interaction of two charges moving in R3 in a magnetic field B can be formulated as a Hamiltonian system with six degrees of freedom. Assuming that the magnetic field is uniform...
D. Pinheiro, R. S. MacKay
DCG
2002
76views more  DCG 2002»
13 years 8 months ago
The Unit Distance Problem for Centrally Symmetric Convex Polygons
Let f(n) be the maximum number of unit distances determined by the vertices of a convex n-gon. Erdos and Moser conjectured that this function is linear. Supporting this conjecture...
Bernardo M. Ábrego, Silvia Fernández...
MP
2007
75views more  MP 2007»
13 years 8 months ago
Solving maximum-entropy sampling problems using factored masks
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
Samuel Burer, Jon Lee
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 8 months ago
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
Arne Meier, Thomas Schneider 0002