Sciweavers

401 search results - page 3 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
CCCG
2007
13 years 8 months ago
Optimal Point Set Partitioning using Rigid Motion Star Placement
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
Prosenjit Bose, Jason Morrison
IPL
2006
105views more  IPL 2006»
13 years 7 months ago
A new approximation algorithm for labeling points with circle pairs
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such...
Minghui Jiang
ANOR
2011
117views more  ANOR 2011»
12 years 11 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
13 years 11 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
JUCS
2007
95views more  JUCS 2007»
13 years 7 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow