304 search results - page 18 / 61 » An Efficient Method for Evaluating Complex Polynomials |
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
DAGM
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. In this paper, we present a novel method for reducing the computational complexity of a Support Vector Machine (SVM) classifier without significant loss of accuracy. We a...
SIGCSE
2006
ACM
14 years 3 months ago
2006
ACM
Target tracking is one of the most important applications of wireless sensor networks. Optimized computation and energy dissipation are critical requirements to maximize the lifet...
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
DAC
1994
ACM
14 years 17 days ago
1994
ACM
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...