1272 search results - page 56 / 255 » The Set Cover with Pairs Problem |
ACSD
2009
IEEE
15 years 5 months ago
2009
IEEE
The application of synthesis of Petri nets from languages for practical problems has recently attracted increasing attention. However, the classical synthesis problems are often n...
106
click to vote
ISAAC
2009
Springer
15 years 5 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
103
Voted
ISF
2008
15 years 8 days ago
2008
In this study, a mathematical model is suggested concerning the location of VHF/UHF frequency radio jammer systems to the terrain parts to conduct single frequency or sequential fr...
110
click to vote
DAC
2005
ACM
16 years 1 months ago
2005
ACM
We obtain analytically, the energy optimal speed profile of a generic multi-speed device with a discrete set of speeds, to execute a given task within a given time. Current implem...
92
Voted
ECCC
2006
15 years 23 days ago
2006
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,