595 search results - page 16 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
143
Voted
INFOCOM
2012
IEEE
13 years 5 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...
165
Voted
ISCA
2012
IEEE
13 years 5 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...
129
Voted
CGO
2009
IEEE
15 years 9 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...
133
Voted
FPGA
1999
ACM
15 years 7 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...
136
Voted
AUSAI
2003
Springer
15 years 7 months 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...