7930 search results - page 1201 / 1586 » Greedy in Approximation Algorithms |
173
click to vote
FCT
2005
Springer
16 years 8 days ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
179
click to vote
VMCAI
2005
Springer
16 years 6 days ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
179
click to vote
ISAAC
2004
Springer
16 years 3 days ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
260
Voted
PSSE
2004
Springer
16 years 3 days ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
173
Voted
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...