Sciweavers

2370 search results - page 144 / 474
» A Structured Set of Higher-Order Problems
Sort
View
118
Voted
IJAC
2002
128views more  IJAC 2002»
15 years 3 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki
135
Voted
DLOG
2007
15 years 5 months ago
Action Based ABox Update: an Example from the Chemical Compound Formulation
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
Alessandro Mosca, Matteo Palmonari
142
Voted
UAI
2004
15 years 4 months ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...
123
Voted
ICML
2002
IEEE
16 years 4 months ago
Multi-Instance Kernels
Learning from structured data is becoming increasingly important. However, most prior work on kernel methods has focused on learning from attribute-value data. Only recently, rese...
Adam Kowalczyk, Alex J. Smola, Peter A. Flach, Tho...
136
Voted
SAT
2010
Springer
125views Hardware» more  SAT 2010»
15 years 7 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton