502 search results - page 44 / 101 » Verifying Balanced Trees |
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
Given the prominence of elite archiving in contemporary multiobjective optimisation research and the limitations inherent in bounded population sizes, it is unusual that the vast ...
JNW
2006
13 years 10 months ago
2006
Whereas multicast transmission in one-to-many communications allows the operator to drastically save network resources, it also makes the routing of the traffic flows more complex ...
SC
1994
ACM
14 years 2 months ago
1994
ACM
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
ICDE
2009
IEEE
14 years 11 months ago
2009
IEEE
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
COCO
2009
Springer
14 years 1 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...