1977 search results - page 107 / 396 » The satisfactory partition problem |
143
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
128
Voted
AMAI
2002
Springer
15 years 6 months ago
2002
Springer
: Mereotopology faces problems when its methods are extended to deal with time and change. We offer a new solution to these problems, based on a theory of partitions of reality wh...
158
Voted
COR
2008
15 years 5 months ago
2008
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
174
click to vote
VLSID
2002
IEEE
16 years 6 months ago
2002
IEEE
IDDQ testing has been used as a test technique to supplement voltage testing of CMOS chips. The idea behind IDDQ testing is to declare a chip as faulty if the steady-state current...
185
Voted
SC
2003
ACM
15 years 11 months ago
2003
ACM
Load balance is critical to achieving scalability for large network emulation studies, which are of compelling interest for emerging Grid, Peer to Peer, and other distributed appl...