401 search results - page 30 / 81 » Algorithms for a Simple Point Placement Problem |
140
Voted
JPDC
2006
15 years 5 months ago
2006
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
159
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
127
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
114
Voted
CIARP
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we describe a heuristic approach to the problem of identifying a pattern embedded within a figure from a predefined set of patterns via the utilization of a genetic a...
128
Voted
ICCSA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...