Sciweavers

1728 search results - page 166 / 346
» The Accelerated Euclidean Algorithm
Sort
View
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 8 months ago
Enhancing differential evolution performance with local search for high dimensional function optimization
In this paper, we proposed Fittest Individual Refinement (FIR), a crossover based local search method for Differential Evolution (DE). The FIR scheme accelerates DE by enhancing...
Nasimul Noman, Hitoshi Iba
VC
2008
132views more  VC 2008»
15 years 3 months ago
Caustic spot light for rendering caustics
It is difficult to render caustic patterns at interactive frame rates. This paper introduces new rendering techniques that relax current constraints, allowing scenes with moving, n...
Xinguo Liu, Zhao Dong, Hujun Bao, Qunsheng Peng
MOBIHOC
2007
ACM
16 years 2 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
15 years 4 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani
TKDE
2008
111views more  TKDE 2008»
15 years 3 months ago
A Point Symmetry-Based Clustering Technique for Automatic Evolution of Clusters
In this paper, a new symmetry-based genetic clustering algorithm is proposed which automatically evolves the number of clusters as well as the proper partitioning from a data set. ...
Sanghamitra Bandyopadhyay, Sriparna Saha