1977 search results - page 276 / 396 » The satisfactory partition problem |
134
Voted
ASPDAC
2007
ACM
15 years 7 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
119
Voted
FGR
2004
IEEE
15 years 7 months ago
2004
IEEE
In the recent years particle filtering has been the dominant paradigm for tracking facial and body features, recognizing temporal events and reasoning in uncertainty. A major prob...
139
Voted
DAWAK
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
147
click to vote
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
118
Voted
DAC
2005
ACM
15 years 5 months ago
2005
ACM
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...