Sciweavers

2695 search results - page 69 / 539
» The Complexity of Forecast Testing
Sort
View
IOLTS
2003
IEEE
124views Hardware» more  IOLTS 2003»
15 years 3 months ago
Designing FPGA based Self-Testing Checkers for m-out-of-n Codes
The paper describes a specific method for designing selfchecking checkers for m-out-of-n codes. The method is oriented to the Field Programmable Gate Arrays technology and is base...
A. Matrosova, Vladimir Ostrovsky, Ilya Levin, K. N...
RSA
2002
51views more  RSA 2002»
14 years 9 months ago
Testing subgraphs in large graphs
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...
Noga Alon
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 4 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...
DEXAW
2005
IEEE
96views Database» more  DEXAW 2005»
15 years 3 months ago
Mining Complex Patterns from Protein Surfaces
In the domain of bioinformatics, the role played in the biological process by proteins, that act as transmitters and receivers of information thus ruling the mechanisms that deter...
Lorenzo Baldacci, Matteo Golfarelli
101
Voted
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
15 years 3 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu