Sciweavers

996 search results - page 45 / 200
» A general method to speed up fixed-parameter-tractable algor...
Sort
View
CPAIOR
2005
Springer
15 years 7 months ago
Computing Explanations for the Unary Resource Constraint
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
Petr Vilím
ESCIENCE
2006
IEEE
15 years 8 months ago
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, La...
ISPD
2006
ACM
102views Hardware» more  ISPD 2006»
15 years 8 months ago
A faster implementation of APlace
APlace is a high quality, scalable analytical placer. This paper describes our recent efforts to improve APlace for speed and scalability. We explore various wirelength and densi...
Andrew B. Kahng, Qinke Wang
KDD
2012
ACM
221views Data Mining» more  KDD 2012»
13 years 4 months ago
Fast mining and forecasting of complex time-stamped events
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
Yasuko Matsubara, Yasushi Sakurai, Christos Falout...
JAIR
2002
163views more  JAIR 2002»
15 years 1 months ago
Efficient Reinforcement Learning Using Recursive Least-Squares Methods
The recursive least-squares (RLS) algorithm is one of the most well-known algorithms used in adaptive filtering, system identification and adaptive control. Its popularity is main...
Xin Xu, Hangen He, Dewen Hu