7930 search results - page 1256 / 1586 » Greedy in Approximation Algorithms |
165
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
198
click to vote
IWLCS
2005
Springer
15 years 11 months ago
2005
Springer
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...
183
Voted
OOPSLA
2005
Springer
15 years 11 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
156
click to vote
WINE
2005
Springer
15 years 11 months ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
158
Voted
SI3D
1999
ACM
15 years 10 months ago
1999
ACM
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...