1142 search results - page 197 / 229 » Approximability of Clausal Constraints |
118
click to vote
INFOCOM
2010
IEEE
15 years 12 days ago
2010
IEEE
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
111
click to vote
LATIN
2010
Springer
15 years 11 days ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
116
click to vote
PVLDB
2010
15 years 10 days ago
2010
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...
140
click to vote
SPIRE
2010
Springer
15 years 10 days ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
117
click to vote
TCOM
2010
15 years 9 days ago
2010
Abstract—This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spect...