971 search results - page 74 / 195 » Planning with Reduced Operator Sets |
125
click to vote
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
We consider the problem of eliminating redundant Boolean features for a given data set, where a feature is redundant if it separates the classes less well than another feature or ...
126
Voted
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
141
click to vote
CPAIOR
2004
Springer
15 years 10 months ago
2004
Springer
This paper addresses the question of selecting an algorithm from a predefined set that will have the best performance on a scheduling problem instance. Our goal is to reduce the e...
139
click to vote
EDBT
2006
ACM
15 years 6 months ago
2006
ACM
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
169
click to vote
JELIA
2010
Springer
15 years 3 months ago
2010
Springer
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...