2131 search results - page 88 / 427 » Immunity for Closed Sets |
86
Voted
VLSID
2002
IEEE
16 years 1 months ago
2002
IEEE
Steiner tree is a fundamental problem in the automatic interconnect optimization for VLSI design. We present a probabilistic analysis method for constructing rectilinear Steiner t...
155
Voted
ISIPTA
2005
IEEE
15 years 6 months ago
2005
IEEE
Sets of probability measures which form neighbourhoods of classical probability measures are studied. An application of Jeffrey’s rule of conditioning to forming neighbourhoods...
WSC
2001
15 years 2 months ago
2001
A constrained Monte Carlo problem arises when one computes an expectation in the presence of a priori computable constraints on the expectations of quantities that are correlated ...
96
Voted
CORR
2010
Springer
15 years 29 days ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
101
Voted
DISOPT
2006
15 years 27 days ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...