Sciweavers

45 search results - page 8 / 9
» Present and Future of Practical SAT Solving
Sort
View
ITNG
2007
IEEE
14 years 1 months ago
Computational Power of the Quantum Turing Automata
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...
ICML
1999
IEEE
14 years 8 months ago
Least-Squares Temporal Difference Learning
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
Justin A. Boyan
KDD
2007
ACM
209views Data Mining» more  KDD 2007»
14 years 7 months ago
Temporal causal modeling with graphical granger methods
The need for mining causality, beyond mere statistical correlations, for real world problems has been recognized widely. Many of these applications naturally involve temporal data...
Andrew Arnold, Yan Liu, Naoki Abe
TELECARE
2004
184views Healthcare» more  TELECARE 2004»
13 years 8 months ago
Securing Mobile Agent Based Tele-Assistance Systems
Nowadays the scientific community is trying to design new techniques in the search for solving security problems in mobile agent technology. There are now some industry initiatives...
Sergio Pozo, Rafael M. Gasca, María Teresa ...
STACS
2004
Springer
14 years 22 days ago
An Algorithmic View on OVSF Code Assignment
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
Thomas Erlebach, Riko Jacob, Matús Mihal&aa...