1484 search results - page 202 / 297 » Ants meeting algorithms |
163
click to vote
CAD
2000
Springer
15 years 6 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
143
click to vote
ENTCS
2002
15 years 6 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
189
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
The recently emerging WiMAX (IEEE 802.16) is a promising telecommunication technology to provide low-cost, high-speed and long-range wireless communications. To meet the growing de...
183
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, the concept of object-oriented embedding (OOE) is introduced into information hiding in general and particularly to steganography which is the science that involves...
193
click to vote
OPODIS
2010
15 years 4 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...