Sciweavers

1773 search results - page 165 / 355
» The Visibility-Voronoi Complex and Its Applications
Sort
View
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
16 years 3 days ago
Solving large scale combinatorial optimization using PMA-SLS
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong, Meng Joo E...
PAKDD
2005
ACM
160views Data Mining» more  PAKDD 2005»
16 years 2 days ago
Improving Mining Quality by Exploiting Data Dependency
The usefulness of the results produced by data mining methods can be critically impaired by several factors such as (1) low quality of data, including errors due to contamination, ...
Fang Chu, Yizhou Wang, Carlo Zaniolo, Douglas Stot...
WMPI
2004
ACM
16 years 11 hour ago
Cache organizations for clustered microarchitectures
Clustered microarchitectures are an effective organization to deal with the problem of wire delays and complexity by partitioning some of the processor resources. The organization ...
José González, Fernando Latorre, Ant...
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
15 years 12 months ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
EUROPKI
2004
Springer
15 years 12 months ago
On the Use of Weber Polynomials in Elliptic Curve Cryptography
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...