10608 search results - page 1666 / 2122 » Complexity of O'Hara's Algorithm |
146
Voted
HPDC
2010
IEEE
15 years 6 months ago
2010
IEEE
A common task in biological research is to predict function for proteins by comparing sequences between proteins of known and unknown function. This is often done using pair-wise ...
150
click to vote
ICML
2010
IEEE
15 years 6 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
146
click to vote
AAAI
2010
15 years 5 months ago
2010
Developing a robust, flexible, closed-loop walking algorithm for a humanoid robot is a challenging task due to the complex dynamics of the general biped walk. Common analytical ap...
141
click to vote
SIGECOM
2010
ACM
15 years 5 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
293
click to vote
AICCSA
2008
IEEE
15 years 5 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...