4843 search results - page 437 / 969 » The Shortcut Problem - Complexity and Approximation |
131
click to vote
LATIN
2010
Springer
15 years 11 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
141
Voted
ICTAI
2009
IEEE
15 years 11 months ago
2009
IEEE
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
134
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
159
click to vote
ADAEUROPE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
179
click to vote
ICCSA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a parallel approach for optimizing surface meshes by redistributing vertices on a feature-aware higher-order reconstruction of a triangulated surface. Our meth...