10608 search results - page 1753 / 2122 » Complexity of O'Hara's Algorithm |
96
Voted
IESS
2007
Springer
15 years 7 months ago
2007
Springer
: Much effort in RTL design has been devoted to developing “push-button” types of tools. However, given the highly complex nature, and lack of control on RTL design, push-butt...
174
click to vote
ILP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
119
click to vote
ISPA
2007
Springer
15 years 7 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
112
Voted
LFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
84
Voted
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...