Sciweavers

2107 search results - page 31 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
13 years 7 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
CNIS
2006
13 years 9 months ago
An efficient hybrid algorithm for multidimensional packet classification
Multidimensional Packet Classification is one of the most critical functions for network security devices such as firewalls and intrusion detection systems. Due to the worst case ...
Yaxuan Qi, Jun Li
HICSS
1994
IEEE
149views Biometrics» more  HICSS 1994»
13 years 11 months ago
Stochastic Problem Solving by Local Computation Based on Self-Organization Paradigm
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
Yasusi Kanada, Masao Hirokawa
ARITH
2005
IEEE
14 years 1 months ago
The Residue Logarithmic Number System: Theory and Implementation
— The Residue Logarithmic Number System (RLNS) represents real values as quantized logarithms which, in turn, are represented using the Residue Number System (RNS). Compared to t...
Mark G. Arnold
ALGORITHMICA
2011
13 years 2 months ago
Crossing Numbers of Graphs with Rotation Systems
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...