Sciweavers

99 search results - page 5 / 20
» Stable normal forms for polynomial system solving
Sort
View
ICAI
2009
13 years 5 months ago
An Alternative Representation for QBF
Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused...
Anja Remshagen, Klaus Truemper
BIRTHDAY
2007
Springer
14 years 1 months ago
Generating Polynomial Invariants with DISCOVERER and QEPCAD
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan
AIPS
2011
12 years 11 months ago
A Polynomial All Outcome Determinization for Probabilistic Planning
Most predominant approaches in probabilistic planning utilize techniques from the more thoroughly investigated field of classical planning by determinizing the problem at hand. I...
Thomas Keller, Patrick Eyerich
LPAR
2012
Springer
12 years 3 months ago
The TPTP Typed First-Order Form with Arithmetic
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Pe...
ICASSP
2007
IEEE
14 years 1 months ago
Sound Source Tracking and Formation using Normalized Cuts
The goal of computational auditory scene analysis (CASA) is to create computer systems that can take as input a mixture of sounds and form packages of acoustic evidence such that ...
Mathieu Lagrange, George Tzanetakis