4516 search results - page 750 / 904 » Data Structures in the Design of Interfaces |
154
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
155
click to vote
CASES
2008
ACM
15 years 6 months ago
2008
ACM
Java applications rely on Just-In-Time (JIT) compilers or adaptive compilers to generate and optimize binary code at runtime to boost performance. In conventional Java Virtual Mac...
151
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
149
click to vote
CONEXT
2008
ACM
15 years 6 months ago
2008
ACM
In response to the limitations of the Internet architecture when used for applications for which it was not originally designed, a series of clean slate efforts have emerged to sh...
135
click to vote
SIROCCO
2008
15 years 5 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...