Sciweavers

1746 search results - page 58 / 350
» Recent Developments in Algorithmic Teaching
Sort
View
ESCIENCE
2006
IEEE
14 years 3 months ago
Hybrid Particle Guide Selection Methods in Multi-Objective Particle Swarm Optimization
This paper presents quantitative comparison of the performance of different methods for selecting the guide particle for multi-objective particle swarm optimization (MOPSO). Two p...
David Ireland, Andrew Lewis, Sanaz Mostaghim, Junw...
IPPS
1999
IEEE
14 years 1 months ago
Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
Takayuki Suyama, Makoto Yokoo, Akira Nagoya
ESA
2004
Springer
124views Algorithms» more  ESA 2004»
14 years 28 days ago
Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements
Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geomet...
Efi Fogel, Ron Wein, Dan Halperin
BMVC
1998
13 years 10 months ago
A Method for Dynamic Clustering of Data
This paper describes a method for the segmentation of dynamic data. It extends well known algorithms developed in the context of static clustering (e.g., the c-means algorithm, Ko...
Arnaldo J. Abrantes, Jorge S. Marques
IJDMMM
2008
87views more  IJDMMM 2008»
13 years 9 months ago
Is an ordinal class structure useful in classifier learning?
In recent years, a number of machine learning algorithms have been developed for the problem of ordinal classification. These algorithms try to exploit, in one way or the other, t...
Jens C. Huhn, Eyke Hüllermeier