1361 search results - page 22 / 273 » Boolean Comparison by Simulation |
WSC
2000
13 years 9 months ago
2000
Batching jobs in a manufacturing system is a very common policy in most industries. The main reasons for batching are avoidance of set ups and/or facilitation of material handling...
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
DAC
2001
ACM
14 years 9 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
MSWIM
2005
ACM
14 years 1 months ago
2005
ACM
There have been various secure routing protocols proposed for mobile ad hoc networks. Most of these protocols are analyzed by two standard techniques: simulation and security anal...
ICML
2004
IEEE
14 years 1 months ago
2004
IEEE
We consider the problem of eliminating redundant Boolean features for a given data set, where a feature is redundant if it separates the classes less well than another feature or ...