2376 search results - page 50 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
TAINN
2005
Springer
14 years 1 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
SYNASC
2006
IEEE
14 years 1 months ago
2006
IEEE
The paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advan...
FCCM
2000
IEEE
14 years 2 days ago
2000
IEEE
For multiple FPGA systems, the limited number of I/O pins causes many problems. To solve these problems, efficient communication scheduling among FPGAs is crucial for obtaining hi...
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
We propose a new fast Feldkamp algorithm for 3-D cone beam tomography with a circular source trajectory. The algorithm is an extension of our recent fast native 2-D fan-beam recon...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
This paper presents a genetic algorithm (GA) for Kmeans clustering. Instead of the widely applied stringof-group-numbers encoding, we encode the prototypes of the clusters into th...