595 search results - page 66 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
205
click to vote
IJIT
2004
15 years 4 months ago
2004
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
142
Voted
PRDC
2007
IEEE
15 years 9 months ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
127
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
172
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—Deep packet inspection (DPI) is often used in network intrusion detection and prevention systems (NIDPS), where incoming packet payloads are compared against known attac...
123
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variab...