4047 search results - page 705 / 810 » The Discrete Basis Problem |
218
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
123
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
133
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in m...
128
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
113
Voted
SIGCOMM
2009
ACM
15 years 10 months ago
2009
ACM
Routing oscillation is highly detrimental. It can decrease performance and lead to a high level of update churn placing unnecessary workload on router the problem is distributed b...