Sciweavers

1300 search results - page 170 / 260
» Probabilistic logic with independence
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
On the Optimality of Planar and Geometric Approximation Schemes
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
Dániel Marx
ICRA
2010
IEEE
147views Robotics» more  ICRA 2010»
13 years 6 months ago
Learning physically-instantiated game play through visual observation
Abstract— We present an integrated vision and robotic system that plays, and learns to play, simple physically-instantiated board games that are variants of TIC TAC TOE and HEXAP...
Andrei Barbu, Siddharth Narayanaswamy, Jeffrey Mar...
ICML
2008
IEEE
14 years 8 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
CADE
2008
Springer
14 years 8 months ago
Exploring Model-Based Development for the Verification of Real-Time Java Code
Many safety- and security-critical systems are real-time systems and, as a result, tools and techniques for verifying real-time systems are extremely important. Simulation and test...
Niusha Hakimipour, Paul A. Strooper, Roger Duke
FSKD
2007
Springer
126views Fuzzy Logic» more  FSKD 2007»
14 years 1 months ago
Rough Set Model Selection for Practical Decision Making
One of the challenges a decision maker faces is choosing a suitable rough set model to use for data analysis. The traditional algebraic rough set model classifies objects into th...
Joseph P. Herbert, Jingtao Yao