1943 search results - page 352 / 389 » Ordering Default Theories |
102
Voted
EUROCAST
2005
Springer
15 years 6 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
100
click to vote
FCT
2005
Springer
15 years 6 months 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. ...
113
Voted
WEA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
112
click to vote
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
134
click to vote
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...