5995 search results - page 1078 / 1199 » Algorithmic Game Theory |
140
click to vote
MOBIHOC
2005
ACM
16 years 3 months ago
2005
ACM
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
138
click to vote
MOBIHOC
2005
ACM
16 years 3 months ago
2005
ACM
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
147
click to vote
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
133
click to vote
ALT
2006
Springer
16 years 23 days ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
152
click to vote
PEPM
2010
ACM
16 years 21 days ago
2010
ACM
A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipul...