1977 search results - page 34 / 396 » The satisfactory partition problem |
152
click to vote
CIE
2007
Springer
16 years 28 min ago
2007
Springer
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...
176
Voted
AE
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
141
Voted
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...
156
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
Improving logic density by time-sharing, time-multiplexed FPGAs (TMFPGAs) have become an important research topic for reconfigurable computing. Due to the precedence and capacity ...
193
click to vote
RTAS
2006
IEEE
15 years 11 months ago
2006
IEEE
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...