4433 search results - page 827 / 887 » Dynamic Optimization of Micro-Operations |
CCO
2001
Springer
14 years 13 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
FOCS
2000
IEEE
14 years 10 days ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
RSP
2000
IEEE
14 years 9 days ago
2000
IEEE
Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools...
SIGMOD
2000
ACM
14 years 8 days ago
2000
ACM
Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an ac...
CGO
2010
IEEE
14 years 8 days ago
2010
IEEE
To improve the performance of transactional memory (TM), researchers have found many eager and lazy optimizations for conflict detection, the process of determining if transaction...