16 search results - page 2 / 4 » Obtaining Better Non-Dominated Sets Using Volume Dominance |
SIAMCOMP
1998
13 years 4 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Graph-cuts based algorithms are effective for a variety
of segmentation tasks in computer vision. Ongoing research
is focused toward making the algorithms even more general,
as ...
DASFAA
2010
IEEE
13 years 10 months ago
2010
IEEE
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
CEC
2005
IEEE
13 years 7 months ago
2005
IEEE
Abstract- Significant operational cost and energy savings can be achieved by optimising the schedules of pumps, which pump water from source reservoirs to storage tanks, in Water ...
TCAD
2008
13 years 5 months ago
2008
At-speed functional testing, delay testing, and n-detection test sets are being used today to detect deep submicrometer defects. However, the resulting test data volumes are too hi...