1243 search results - page 48 / 249 » On the locality of bounded growth |
ICGA
1997
13 years 9 months ago
1997
This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
HAPTICS
2002
IEEE
14 years 19 days ago
2002
IEEE
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
NIPS
2007
13 years 9 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...