Sciweavers

882 search results - page 110 / 177
» Local Search for Very Large SAT Problems
Sort
View
BCB
2010
156views Bioinformatics» more  BCB 2010»
14 years 11 months ago
Accelerating HMMER on GPUs by implementing hybrid data and task parallelism
Many biologically motivated problems are expressed as dynamic programming recurrences and are difficult to parallelize due to the intrinsic data dependencies in their algorithms. ...
Narayan Ganesan, Roger D. Chamberlain, Jeremy Buhl...
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
15 years 10 months ago
Multiresolution Approach for Motion Planning under Differential Constraints
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
Stephen R. Lindemann, Steven M. LaValle
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
15 years 9 months ago
Association Rule Mining in Peer-to-Peer Systems
We extend the problem of association rule mining – a key data mining problem – to systems in which the database is partitioned among a very large number of computers that are ...
Ran Wolff, Assaf Schuster
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
15 years 5 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
IASTEDSEA
2004
15 years 5 months ago
Deriving change architectures from RCS history
As software systems evolve over a series of releases, it becomes important to know which components show repeated need for maintenance. Deterioration of a single component manifes...
Catherine Stringfellow, C. D. Amory, Dileep Potnur...