Sciweavers

16404 search results - page 413 / 3281
» A set coverage problem
Sort
View
COR
2010
108views more  COR 2010»
15 years 6 months ago
GRASP and path relinking for the max-min diversity problem
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The prob...
Mauricio G. C. Resende, Rafael Martí, Micae...
DKE
2006
93views more  DKE 2006»
15 years 6 months ago
The ramification problem in temporal databases: Changing beliefs about the past
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
Nikos Papadakis, Grigoris Antoniou, Dimitris Plexo...
INFORMATICALT
2006
110views more  INFORMATICALT 2006»
15 years 6 months ago
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
Gintaras Palubeckis
GEM
2010
15 years 4 months ago
Revisiting Genetic Algorithms for the FPGA Placement Problem
In this work, we present a genetic algorithm framework for the FPGA placement problem. This framework is constructed based on previous proposals in this domain. We implement this f...
Peter Jamieson
CVPR
2009
IEEE
17 years 2 months ago
A Stereo Approach that Handles the Matting Problem via Image Warping
We propose an algorithm that simultaneously extracts disparities and alpha matting information given a stereo image pair. Our method divides the reference image into a set of ov...
Michael Bleyer (Vienna University of Technology), ...