Sciweavers

188 search results - page 10 / 38
» Evaluation of representations in AI problem solving
Sort
View
KCAP
2003
ACM
14 years 24 days ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
IJCAI
2001
13 years 9 months ago
Planning with Resources and Concurrency: A Forward Chaining Approach
Recently tremendous advances have been made in the performance of AI planning systems. However increased performance is only one of the prerequisites for bringing planning into th...
Fahiem Bacchus, Michael Ady
NAACL
2010
13 years 5 months ago
Discriminative Learning over Constrained Latent Representations
This paper proposes a general learning framework for a class of problems that require learning over latent intermediate representations. Many natural language processing (NLP) dec...
Ming-Wei Chang, Dan Goldwasser, Dan Roth, Vivek Sr...
CASC
2005
Springer
113views Mathematics» more  CASC 2005»
14 years 1 months ago
Real Solving of Bivariate Polynomial Systems
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
Ioannis Z. Emiris, Elias P. Tsigaridas
DAC
2009
ACM
14 years 8 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke