595 search results - page 16 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
ISCA
2012
IEEE
11 years 9 months ago
2012
IEEE
Languages such as C and C++ use unsafe manual memory management, allowing simple bugs (i.e., accesses to an object after deallocation) to become the root cause of exploitable secu...
CGO
2009
IEEE
14 years 2 months ago
2009
IEEE
—Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total St...
FPGA
1999
ACM
13 years 11 months ago
1999
ACM
Procedural textures can be effectively used to enhance the visual realism of computer rendered images. Procedural textures can provide higher realism for 3-D objects than traditio...
AUSAI
2003
Springer
14 years 18 days ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...