44 search results - page 6 / 9 » A Complete Anytime Algorithm for Number Partitioning |
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
JASIS
2007
13 years 7 months ago
2007
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
ACSAC
1999
IEEE
14 years 2 days ago
1999
IEEE
Recently, application-level isolation was introduced as an effective means of containing the damage that a suspicious user could inflict on data. In most cases, only a subset of t...