64 search results - page 2 / 13 » Greedy wire-sizing is linear time |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
DEDS
2010
13 years 6 months ago
2010
We study approaches that fit a linear combination of basis functions to the continuation value function of an optimal stopping problem and then employ a greedy policy based on the...
ESA
2006
Springer
13 years 10 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
ESWS
2011
Springer
12 years 9 months ago
2011
Springer
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
WG
2010
Springer
13 years 4 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...