240 search results - page 33 / 48 » On the One-Dimensional Optimal Switching Problem |
SIGSOFT
2010
ACM
13 years 7 months ago
2010
ACM
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...
ICN
2001
Springer
14 years 2 months ago
2001
Springer
In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the ...
PODS
2009
ACM
14 years 10 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
GECCO
2010
Springer
14 years 2 months ago
2010
Springer
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
FPGA
1997
ACM
14 years 2 months ago
1997
ACM
We present a general approach to the FPGA technology mapping problem that applies to any logic block composed of lookup tables LUTs and can yield optimal solutions. The connecti...