2612 search results - page 270 / 523 » Switching Graphs and Their Complexity |
248
Voted
CORR
2010
Springer
15 years 13 days ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
170
click to vote
PODC
2009
ACM
16 years 23 days ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
166
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
158
click to vote
BIB
2007
15 years 6 months ago
2007
Mathematical modelling is increasingly used to get insights into the functioning of complex biological networks. In this context, Petri nets (PNs) have recently emerged as a promi...
172
click to vote
DISOPT
2007
15 years 6 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...