9842 search results - page 417 / 1969 » The Complexity of the Matching-Cut Problem |
124
Voted
IPL
2010
15 years 3 months ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
137
click to vote
SASO
2010
IEEE
15 years 2 months ago
2010
IEEE
Self-organising systems are a popular engineering concept for designing decentralised autonomic computing systems. They are able to find solutions in complex and versatile problem ...
154
click to vote
HCI
2009
15 years 2 months ago
2009
We have explored using neurophysiologic patterns as an approach for developing a deeper understanding of how teams collaborate when solving time-critical, complex real-world proble...
149
click to vote
TMC
2011
14 years 11 months ago
2011
— This paper establishes the equivalence between cognitive medium access and the competitive multi-armed bandit problem. First, the scenario in which a single cognitive user wish...
155
Voted
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—In this paper we study the resource allocation in OFDM-based cognitive radio (CR) networks, under the consideration of many practical limitations such as imperfect spectrum sens...