Sciweavers

597 search results - page 13 / 120
» New Algorithms for Improved Transcendental Functions on IA-6...
Sort
View
ECCV
2000
Springer
14 years 10 months ago
Improvements to Gamut Mapping Colour Constancy Algorithms
Abstract. In his paper we introduce two improvements to the threedimensional gamut mapping approach to computational colour constancy. This approach consist of two separate parts. ...
Kobus Barnard
GECCO
2005
Springer
121views Optimization» more  GECCO 2005»
14 years 1 months ago
New evolutionary techniques for test-program generation for complex microprocessor cores
Checking if microprocessor cores are fully functional at the end of the productive process has become a major issue. Traditional functional approaches are not sufficient when cons...
Ernesto Sánchez, Massimiliano Schillaci, Ma...
ECCC
2010
108views more  ECCC 2010»
13 years 5 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...
FLAIRS
2000
13 years 9 months ago
Partitioning Sets with Genetic Algorithms
We first revisit a problem in the literature of genetic algorithms: arranging numbers into groups whose summed weights are as nearly equal as possible. We provide a new genetic al...
William A. Greene
CAEPIA
2003
Springer
14 years 1 months ago
A New Genetic Approach for the Partitioning Problem in Distributed Virtual Environment Systems
The Partitioning problem is a key issue in the design of Distributed Virtual Environment (DVE) systems based on a server-network architecture. This problem consist of efficiently ...
Pedro Morillo, Pedro López, Juan M. Ordu&nt...