The following pages link to Konstantin E. Avrachenkov (Q702267):
Displaying 38 items.
- Distributed Weight Selection in Consensus Protocols by Schatten Norm Minimization (Q2982744) (← links)
- A Singular Perturbation Approach for Choosing the PageRank Damping Factor (Q3078597) (← links)
- The Multi-Dimensional Version of � b a x p dx (Q3146552) (← links)
- Stochastic Coalitional Better-Response Dynamics for Finite Games with Application to Network Formation Games (Q3295124) (← links)
- PageRank in Undirected Random Graphs (Q3460746) (← links)
- RETRIAL NETWORKS WITH FINITE BUFFERS AND THEIR APPLICATION TO INTERNET DATA TRAFFIC (Q3541000) (← links)
- A Jamming Game in Wireless Networks with Transmission Cost (Q3614955) (← links)
- Transmission Power Control Game with SINR as Objective Function (Q3616981) (← links)
- (Q3647851) (← links)
- Alpha-Fair Resource Allocation under Incomplete Information and Presence of a Jammer (Q3651234) (← links)
- (Q4428445) (← links)
- (Q4443298) (← links)
- (Q4547436) (← links)
- Whittle Index Policy for Crawling Ephemeral Content (Q4562366) (← links)
- Linear-quadratic discrete-time dynamic potential games (Q4600171) (← links)
- The Power of Side-Information in Subgraph Detection (Q4621706) (← links)
- (Q4630434) (← links)
- Perturbation analysis for denumerable Markov chains with application to queueing models (Q4662241) (← links)
- (Q4805047) (← links)
- The fundamental matrix of singularly perturbed Markov chains (Q4944086) (← links)
- Game-Theoretic Centrality Measures for Weighted Graphs (Q4976402) (← links)
- Quick Detection of Nodes with Large Degrees (Q4985346) (← links)
- Kernels on Graphs as Proximity Measures (Q5045293) (← links)
- EVOLUTIONARY DYNAMICS IN DISCRETE TIME FOR THE PERTURBED POSITIVE DEFINITE REPLICATOR EQUATION (Q5150285) (← links)
- Full Gradient DQN Reinforcement Learning: A Provably Convergent Scheme (Q5153609) (← links)
- Infinite horizon optimal impulsive control with applications to Internet congestion control (Q5266162) (← links)
- Analytic perturbation of Sylvester matrix equations (Q5267138) (← links)
- Semi-supervised learning with regularized Laplacian (Q5268919) (← links)
- (Q5297380) (← links)
- Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient (Q5386203) (← links)
- Asymptotic Fluid Optimality and Efficiency of the Tracking Policy for Bandwidth-Sharing Networks (Q5391084) (← links)
- Markov Processes with Restart (Q5407020) (← links)
- Distribution of PageRank Mass Among Principle Components of the Web (Q5458297) (← links)
- The Effect of New Links on Google Pagerank (Q5478910) (← links)
- (Q5493446) (← links)
- PageRank of Scale-Free Growing Networks (Q5755206) (← links)
- Analysis of Relaxation Time in Random Walk with Jumps (Q5881229) (← links)
- On the normalized Laplacian spectra of random geometric graphs (Q6042058) (← links)
