3433 search results - page 72 / 687 » Heuristics for a bidding problem |
MTV
2003
IEEE
14 years 2 months ago
2003
IEEE
Bounded Model Checking (BMC) techniques have been used for formal hardware verification, with the help of tools such as GRASP (Generic search Algorithm for Satisfiability Proble...
TEC
2008
13 years 8 months ago
2008
This paper deals with the optimal computation of finite field exponentiation, which is a well-studied problem with many important applications in the areas of error-correcting code...
IJCNN
2007
IEEE
14 years 3 months ago
2007
IEEE
— Solvers for the Boolean satisfiability problem are an important base technology for many applications. The most efficient SAT solvers for industrial applications are based on...
HASE
1998
IEEE
14 years 1 months ago
1998
IEEE
Effective discrimination between transient and permanent faults is a very important practical problem in (dependable) system design. A count-andthreshold mechanism named -count, d...
ISCAS
1994
IEEE
14 years 1 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...