Sciweavers

1949 search results - page 214 / 390
» A New Class Based Associative Classification Algorithm
Sort
View
SYNASC
2005
IEEE
110views Algorithms» more  SYNASC 2005»
14 years 3 months ago
Performance Tuning of Evolutionary Algorithms Using Particle Sub Swarms
Particle Swarm Optimization (PSO) technique proved its ability to deal with very complicated optimization and search problems. This paper proposes a new particle swarm variant whi...
Crina Grosan, Ajith Abraham, Monica Nicoara
SIGGRAPH
1994
ACM
14 years 2 months ago
A fast shadow algorithm for area light sources using backprojection
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...
George Drettakis, Eugene Fiume
TCOM
2008
74views more  TCOM 2008»
13 years 10 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
MP
1998
109views more  MP 1998»
13 years 10 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
JAIR
2007
141views more  JAIR 2007»
13 years 10 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf