4860 search results - page 559 / 972 » SNPs Problems, Complexity, and Algorithms |
146
click to vote
WINE
2009
Springer
15 years 9 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
148
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
125
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
175
click to vote
DATAMINE
2010
15 years 4 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
116
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper we consider the problem of gossiping in a network to diffuse the average of a sub-set of nodes, called sources, and directing it to another sub-set of nodes in the ne...