4486 search results - page 531 / 898 » Adaptable Boundary Sets |
254
click to vote
KDD
2003
ACM
16 years 8 months ago
2003
ACM
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...
193
click to vote
ICCAD
2005
IEEE
16 years 4 months ago
2005
IEEE
Modern design requirements have brought additional complexities to netlists and layouts. Millions of components, whitespace resources, and fixed/movable blocks are just a few to ...
230
click to vote
INFOCOM
2009
IEEE
16 years 2 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
158
Voted
WDAG
2009
Springer
16 years 2 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
184
click to vote
GECCO
2009
Springer
16 years 2 months ago
2009
Springer
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...