Sciweavers

49 search results - page 7 / 10
» Hardness of Set Cover with Intersection 1
Sort
View
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 2 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
ICRA
1994
IEEE
127views Robotics» more  ICRA 1994»
15 years 2 months ago
"RISC" for Industrial Robotics: Recent Results and Open Problems
At the intersection of robotics, computational geometry, and manufacturingengineering, we have identifieda collection of research problems with near-term industrial applications. ...
John F. Canny, Kenneth Y. Goldberg
75
Voted
AAAI
2008
15 years 25 days ago
On the Dimensionality of Voting Games
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
86
Voted
GLOBECOM
2006
IEEE
15 years 4 months ago
A Coverage-Preserving and Hole Tolerant Based Scheme for the Irregular Sensing Range in Wireless Sensor Networks
— Coverage is an important issue related to WSN quality of service. Several centralized/decentralized solutions based on the geometry information of sensors and under the assumpt...
Azzedine Boukerche, Xin Fei, Regina Borges de Arau...
EJC
2007
14 years 10 months ago
Proof of the oval conjecture for planar partition functions
We prove that the translation plane and the shift plane defined by a planar partition function form an oval pair of projective planes in the sense that the planes share a line pe...
Nils Rosehr