459 search results - page 19 / 92 » Approximation Algorithms for Buy-at-Bulk Geometric Network D... |
150
click to vote
CAD
2008
Springer
15 years 5 months ago
2008
Springer
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
150
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
158
click to vote
ISAAC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
158
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
164
Voted
WCNC
2010
IEEE
15 years 9 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...