Sciweavers

331 search results - page 8 / 67
» Comparing Reductions to NP-Complete Sets
Sort
View
PAA
2008
13 years 7 months ago
Prototype reduction using an artificial immune model
Artificial immune system (AIS)-based pattern classification approach is relatively new in the field of pattern recognition. The study explores the potentiality of this paradigm in ...
Utpal Garain
COR
2010
105views more  COR 2010»
13 years 7 months ago
Effective formulation reductions for the quadratic assignment problem
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...
JUCS
2011
97views more  JUCS 2011»
13 years 2 months ago
An OCR Free Method for Word Spotting in Printed Documents: the Evaluation of Different Feature Sets
: An OCR free word spotting method is developed and evaluated under a strong experimental protocol. Different feature sets are evaluated under the same experimental conditions. In ...
Israel Rios, Alceu de Souza Britto Jr., Alessandro...
GLVLSI
2007
IEEE
139views VLSI» more  GLVLSI 2007»
14 years 1 months ago
Synthesis of irregular combinational functions with large don't care sets
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
Valentin Gherman, Hans-Joachim Wunderlich, R. D. M...
WSC
1998
13 years 8 months ago
Efficiency Improvement by Lattice Rules for Pricing Asian Options
This paper compares Monte Carlo methods, lattice rules, and other low-discrepancy point sets on the problem of evaluating asian options. The combination of these methods with vari...
Christiane Lemieux, Pierre L'Ecuyer