Sciweavers

33 search results - page 5 / 7
» On the Positive-Negative Partial Set Cover problem
Sort
View
ICRA
2008
IEEE
125views Robotics» more  ICRA 2008»
15 years 4 months ago
An approximation algorithm for the least overlapping p-Frame problem with non-partial coverage for networked robotic cameras
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
Yiliang Xu, Dezhen Song, Jingang Yi, A. Frank van ...
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
15 years 2 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...
EDBT
2009
ACM
127views Database» more  EDBT 2009»
15 years 4 months ago
Answering aggregate keyword queries on relational databases using minimal group-bys
Keyword search has been recently extended to relational databases to retrieve information from text-rich attributes. However, all the existing methods focus on finding individual...
Bin Zhou 0002, Jian Pei
MP
1998
105views more  MP 1998»
14 years 9 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
ICLP
2004
Springer
15 years 2 months ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir