Sciweavers

624 search results - page 71 / 125
» Test set compaction algorithms for combinational circuits
Sort
View
IBPRIA
2007
Springer
15 years 10 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
José Oncina, Franck Thollard, Eva Gó...
AUTONOMICS
2009
ACM
15 years 11 months ago
Sensor Selection for IT Infrastructure Monitoring
Supervisory control is the main means to assure a high level performance and availability of large IT infrastructures. Applied control theory is used in physical and virtualization...
Gergely János Paljak, Imre Kocsis, Zolt&aac...
ISICA
2007
Springer
15 years 10 months ago
A Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous ...
Changhe Li, Yong Liu, Aimin Zhou, Lishan Kang, Hui...
ICTAI
2006
IEEE
15 years 10 months ago
MI-Winnow: A New Multiple-Instance Learning Algorithm
We present MI-Winnow, a new multiple-instance learning (MIL) algorithm that provides a new technique to convert MIL data into standard supervised data. In MIL each example is a co...
Sharath R. Cholleti, Sally A. Goldman, Rouhollah R...
IFIP
2010
Springer
14 years 11 months ago
Model Checking of Concurrent Algorithms: From Java to C
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...
Cyrille Artho, Masami Hagiya, Watcharin Leungwatta...