2292 search results - page 398 / 459 » Techniques and tools for dynamic optimization |
CCO
2001
Springer
14 years 19 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...
SIGMOD
2000
ACM
14 years 15 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...
RTSS
1999
IEEE
14 years 12 days ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
CASES
2004
ACM
13 years 12 months ago
2004
ACM
The tremendous growth of system memories has increased the capacities and capabilities of memory-resident embedded databases, yet current embedded databases need to be tuned in or...
PLDI
1995
ACM
13 years 11 months ago
1995
ACM
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...