5624 search results - page 224 / 1125 » On Conditional Covering Problem |
191
click to vote
SIGCOMM
1997
ACM
15 years 10 months ago
1997
ACM
The floor acquisition multiple access (FAMA) discipline is analyzed in networks with hidden terminals. According to FAMA, control of the channel (the floor) is assigned to at mo...
164
click to vote
DAGSTUHL
2008
15 years 8 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
155
click to vote
LREC
2010
15 years 8 months ago
2010
Typical broadcast material contains not only studio-recorded texts read by trained speakers, but also spontaneous and dialect speech, debates with cross-talk, voice-overs, and on-...
179
click to vote
DM
2007
15 years 6 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
194
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...