3946 search results - page 102 / 790 » The computational complexity of choice sets |
164
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
136
click to vote
NIPS
2000
15 years 7 months ago
2000
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
197
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
195
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
154
click to vote
FOCS
2005
IEEE
16 years 2 days ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...