2152 search results - page 200 / 431 » A Comparative Study of 2QBF Algorithms |
191
Voted
MM
2004
ACM
16 years 14 days ago
2004
ACM
We present a method for searching databases of symbolically represented polyphonic music that exploits advantages of transportation distances such as continuity and partial matchi...
131
click to vote
ICCS
2004
Springer
16 years 12 days ago
2004
Springer
Our research subject in the present paper is concerned with the minimization of multicast delay variation under the multicast endto-end delay constraint. The delay- and delay varia...
206
Voted
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
16 years 9 days ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
200
Voted
BMCBI
2007
15 years 7 months ago
2007
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
170
click to vote
KAIS
2006
15 years 7 months ago
2006
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...