Sciweavers

16404 search results - page 167 / 3281
» A set coverage problem
Sort
View
126
Voted
WADS
1995
Springer
107views Algorithms» more  WADS 1995»
15 years 7 months ago
Quadrangulations of Planar Sets
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Godfried T. Toussaint
GECCO
2008
Springer
153views Optimization» more  GECCO 2008»
15 years 4 months ago
G-Metric: an M-ary quality indicator for the evaluation of non-dominated sets
An open problem in multiobjective optimization using the Pareto optimality criteria, is how to evaluate the performance of different evolutionary algorithms that solve multi– o...
Giovanni Lizárraga Lizárraga, Arturo...
111
Voted
ICPR
2004
IEEE
16 years 4 months ago
Efficient Calculation of the Complete Optimal Classification Set
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
Martin Brown, Nicholas Costen, Shigeru Akamatsu
115
Voted
DALT
2009
Springer
15 years 10 months ago
Reasoning and Planning with Cooperative Actions for Multiagents Using Answer Set Programming
In this paper, we investigate the multiagent planning problem in the presence of cooperative actions and agents, which have their own goals and are willing to cooperate. To this en...
Tran Cao Son, Chiaki Sakama
ICCTA
2007
IEEE
15 years 9 months ago
Covering a Set of Points in a Plane Using Two Parallel Rectangles
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
Chandan Saha, Sandip Das