Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"University of Illinois – Urbana-Champaign" +contributor:("Srikant, Rayadurgam"). Showing records 1 – 30 of 65 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Department

▼ Search Limiters


University of Illinois – Urbana-Champaign

1. Jiang, Chong. Parametrized Stochastic Multi-armed Bandits with Binary Rewards.

Degree: MS, 1200, 2011, University of Illinois – Urbana-Champaign

 In this thesis, we consider the problem of multi-armed bandits with a large number of correlated arms. We assume that the arms have Bernoulli distributed… (more)

Subjects/Keywords: multi-armed bandits; machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jiang, C. (2011). Parametrized Stochastic Multi-armed Bandits with Binary Rewards. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/18352

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jiang, Chong. “Parametrized Stochastic Multi-armed Bandits with Binary Rewards.” 2011. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/18352.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jiang, Chong. “Parametrized Stochastic Multi-armed Bandits with Binary Rewards.” 2011. Web. 11 Apr 2021.

Vancouver:

Jiang C. Parametrized Stochastic Multi-armed Bandits with Binary Rewards. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/18352.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jiang C. Parametrized Stochastic Multi-armed Bandits with Binary Rewards. [Thesis]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/18352

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

2. Gupta, Harsh. Low-complexity, low-regret link rate selection in rapidly varying wireless channels.

Degree: MS, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

 We consider the problem of transmitting at the optimal rate over a rapidly varying wireless channel with unknown statistics when the feedback about channel quality… (more)

Subjects/Keywords: Link rate selection; Thompson sampling; Regret minimization; Computational complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gupta, H. (2017). Low-complexity, low-regret link rate selection in rapidly varying wireless channels. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/99200

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Gupta, Harsh. “Low-complexity, low-regret link rate selection in rapidly varying wireless channels.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/99200.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Gupta, Harsh. “Low-complexity, low-regret link rate selection in rapidly varying wireless channels.” 2017. Web. 11 Apr 2021.

Vancouver:

Gupta H. Low-complexity, low-regret link rate selection in rapidly varying wireless channels. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/99200.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gupta H. Low-complexity, low-regret link rate selection in rapidly varying wireless channels. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/99200

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

3. Satpathi, Siddhartha. Perfect clustering from pairwise comparisons.

Degree: MS, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

 We consider a pairwise comparisons model with n users and m items. Each user is shown a few pairs of items, and when a pair… (more)

Subjects/Keywords: Pairwise comparison; Spectral clustering; Inference; Ranking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Satpathi, S. (2017). Perfect clustering from pairwise comparisons. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/99229

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Satpathi, Siddhartha. “Perfect clustering from pairwise comparisons.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/99229.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Satpathi, Siddhartha. “Perfect clustering from pairwise comparisons.” 2017. Web. 11 Apr 2021.

Vancouver:

Satpathi S. Perfect clustering from pairwise comparisons. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/99229.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Satpathi S. Perfect clustering from pairwise comparisons. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/99229

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

4. Tan, Bo. Optimization in stochastic models of network applications.

Degree: PhD, 1200, 2012, University of Illinois – Urbana-Champaign

 In this dissertation, we propose stochastic models and develop optimal or near-optimal algorithms for resource allocation, for two important network applications: 1) video-on-demand (VoD) services… (more)

Subjects/Keywords: Content Distribution Networks; Online Advertising; Stochastic Models; Optimization; Resource Allocation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tan, B. (2012). Optimization in stochastic models of network applications. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/34431

Chicago Manual of Style (16th Edition):

Tan, Bo. “Optimization in stochastic models of network applications.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/34431.

MLA Handbook (7th Edition):

Tan, Bo. “Optimization in stochastic models of network applications.” 2012. Web. 11 Apr 2021.

Vancouver:

Tan B. Optimization in stochastic models of network applications. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/34431.

Council of Science Editors:

Tan B. Optimization in stochastic models of network applications. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/34431


University of Illinois – Urbana-Champaign

5. Gupta, Harsh. Sample-efficient reinforcement learning.

Degree: PhD, Electrical & Computer Engr, 2020, University of Illinois – Urbana-Champaign

 Reinforcement learning has been instrumental in the recent advances made by artificial intelligence agents in various domains. Most of these advances have been abetted by… (more)

Subjects/Keywords: reinforcement learning; sample-efficient learning; bandits; q-learning; td-learning; stochastic approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gupta, H. (2020). Sample-efficient reinforcement learning. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/109429

Chicago Manual of Style (16th Edition):

Gupta, Harsh. “Sample-efficient reinforcement learning.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/109429.

MLA Handbook (7th Edition):

Gupta, Harsh. “Sample-efficient reinforcement learning.” 2020. Web. 11 Apr 2021.

Vancouver:

Gupta H. Sample-efficient reinforcement learning. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/109429.

Council of Science Editors:

Gupta H. Sample-efficient reinforcement learning. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/109429


University of Illinois – Urbana-Champaign

6. Hoff, Jonathan E. Trajectory optimization and data-driven modeling for robotic bat flapping flight.

Degree: PhD, Electrical & Computer Engr, 2020, University of Illinois – Urbana-Champaign

 Planning flight trajectories is essential for practical application of flying systems. This topic has been well studied for fixed and rotary winged aerial vehicles, but… (more)

Subjects/Keywords: biologically inspired robots; aerial vehicles; underactuated robots; flapping flight; trajectory planning; aerodynamics; dynamics; data-driven modeling; parameter estimation; optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hoff, J. E. (2020). Trajectory optimization and data-driven modeling for robotic bat flapping flight. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/107903

Chicago Manual of Style (16th Edition):

Hoff, Jonathan E. “Trajectory optimization and data-driven modeling for robotic bat flapping flight.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/107903.

MLA Handbook (7th Edition):

Hoff, Jonathan E. “Trajectory optimization and data-driven modeling for robotic bat flapping flight.” 2020. Web. 11 Apr 2021.

Vancouver:

Hoff JE. Trajectory optimization and data-driven modeling for robotic bat flapping flight. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/107903.

Council of Science Editors:

Hoff JE. Trajectory optimization and data-driven modeling for robotic bat flapping flight. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/107903


University of Illinois – Urbana-Champaign

7. Yekkehkhany, Ali. Risk-averse multi-armed bandits and game theory.

Degree: PhD, Electrical & Computer Engr, 2020, University of Illinois – Urbana-Champaign

 The multi-armed bandit (MAB) and game theory literature is mainly focused on the expected cumulative reward and the expected payoffs in a game, respectively. In… (more)

Subjects/Keywords: Online Learning; Multi-Armed Bandits; Exploration-Exploitation; Explore-Then-Commit Bandits; Risk-Aversion; Game Theory; Stochastic Game Theory; Congestion Games; Affinity Scheduling; MapReduce; Data Center

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yekkehkhany, A. (2020). Risk-averse multi-armed bandits and game theory. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/108439

Chicago Manual of Style (16th Edition):

Yekkehkhany, Ali. “Risk-averse multi-armed bandits and game theory.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/108439.

MLA Handbook (7th Edition):

Yekkehkhany, Ali. “Risk-averse multi-armed bandits and game theory.” 2020. Web. 11 Apr 2021.

Vancouver:

Yekkehkhany A. Risk-averse multi-armed bandits and game theory. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/108439.

Council of Science Editors:

Yekkehkhany A. Risk-averse multi-armed bandits and game theory. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/108439


University of Illinois – Urbana-Champaign

8. Ghassami, Amiremad. Causal discovery beyond Markov equivalence.

Degree: PhD, Electrical & Computer Engr, 2020, University of Illinois – Urbana-Champaign

 The focus of the dissertation is on learning causal diagrams beyond Markov equivalence. The baseline assumptions in causal structure learning are the acyclicity of the… (more)

Subjects/Keywords: Causal Discovery; Directed Graphs; Markov Equivalence; Interventional Causal Structure Learning; Multi-domain Causal Structure Learning; Distribution Equivalence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ghassami, A. (2020). Causal discovery beyond Markov equivalence. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/108456

Chicago Manual of Style (16th Edition):

Ghassami, Amiremad. “Causal discovery beyond Markov equivalence.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/108456.

MLA Handbook (7th Edition):

Ghassami, Amiremad. “Causal discovery beyond Markov equivalence.” 2020. Web. 11 Apr 2021.

Vancouver:

Ghassami A. Causal discovery beyond Markov equivalence. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/108456.

Council of Science Editors:

Ghassami A. Causal discovery beyond Markov equivalence. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/108456


University of Illinois – Urbana-Champaign

9. Joshi, Girish. Adapt-to-learn policy transfer in reinforcement learning and deep model reference adaptive control.

Degree: PhD, Aerospace Engineering, 2020, University of Illinois – Urbana-Champaign

 Adaptation and Learning from exploration have been a key in biological learning; Humans and animals do not learn every task in isolation; rather are able… (more)

Subjects/Keywords: Reinforcement Learning; Policy Transfer in Reinforcement Learning; Adapt to Learn; Adaptive Control; MRAC; Deep Model Reference Adaptive Control.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Joshi, G. (2020). Adapt-to-learn policy transfer in reinforcement learning and deep model reference adaptive control. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/108463

Chicago Manual of Style (16th Edition):

Joshi, Girish. “Adapt-to-learn policy transfer in reinforcement learning and deep model reference adaptive control.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/108463.

MLA Handbook (7th Edition):

Joshi, Girish. “Adapt-to-learn policy transfer in reinforcement learning and deep model reference adaptive control.” 2020. Web. 11 Apr 2021.

Vancouver:

Joshi G. Adapt-to-learn policy transfer in reinforcement learning and deep model reference adaptive control. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/108463.

Council of Science Editors:

Joshi G. Adapt-to-learn policy transfer in reinforcement learning and deep model reference adaptive control. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/108463


University of Illinois – Urbana-Champaign

10. Mishra, Anshuman. Team decision theory of switched static and dynamic systems.

Degree: PhD, 0133, 2014, University of Illinois – Urbana-Champaign

 This dissertation considers the decentralized control of switched linear systems with parameter dependent cost and system matrices. This problem class is investigated under a number… (more)

Subjects/Keywords: Team decision theory; Decentralized control; Switched control; Nested systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mishra, A. (2014). Team decision theory of switched static and dynamic systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50711

Chicago Manual of Style (16th Edition):

Mishra, Anshuman. “Team decision theory of switched static and dynamic systems.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/50711.

MLA Handbook (7th Edition):

Mishra, Anshuman. “Team decision theory of switched static and dynamic systems.” 2014. Web. 11 Apr 2021.

Vancouver:

Mishra A. Team decision theory of switched static and dynamic systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/50711.

Council of Science Editors:

Mishra A. Team decision theory of switched static and dynamic systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50711


University of Illinois – Urbana-Champaign

11. Aghasadeghi, Navid. Inverse optimal control for differentially flat systems with application to lower-limb prosthetic devices.

Degree: PhD, Electrical & Computer Engr, 2015, University of Illinois – Urbana-Champaign

 Powered prosthetic devices have shown to be capable of restoring natural gait to amputees. However, the commercialization of these devices is faced by some challenges,… (more)

Subjects/Keywords: Prosthetic control; Learning from demonstration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Aghasadeghi, N. (2015). Inverse optimal control for differentially flat systems with application to lower-limb prosthetic devices. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78483

Chicago Manual of Style (16th Edition):

Aghasadeghi, Navid. “Inverse optimal control for differentially flat systems with application to lower-limb prosthetic devices.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/78483.

MLA Handbook (7th Edition):

Aghasadeghi, Navid. “Inverse optimal control for differentially flat systems with application to lower-limb prosthetic devices.” 2015. Web. 11 Apr 2021.

Vancouver:

Aghasadeghi N. Inverse optimal control for differentially flat systems with application to lower-limb prosthetic devices. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/78483.

Council of Science Editors:

Aghasadeghi N. Inverse optimal control for differentially flat systems with application to lower-limb prosthetic devices. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78483


University of Illinois – Urbana-Champaign

12. Yu, Ge. Dynamic online resource allocation problems.

Degree: PhD, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 Online resource allocation problems consider assigning a limited number of available resources to sequentially arriving requests with the objective to maximize rewards. With the emergence… (more)

Subjects/Keywords: Online assignment; resource allocation problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yu, G. (2018). Dynamic online resource allocation problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100930

Chicago Manual of Style (16th Edition):

Yu, Ge. “Dynamic online resource allocation problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/100930.

MLA Handbook (7th Edition):

Yu, Ge. “Dynamic online resource allocation problems.” 2018. Web. 11 Apr 2021.

Vancouver:

Yu G. Dynamic online resource allocation problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/100930.

Council of Science Editors:

Yu G. Dynamic online resource allocation problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100930


University of Illinois – Urbana-Champaign

13. Doan, Thinh Thanh. On the performance of distributed algorithms for network optimization problems.

Degree: PhD, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 This thesis considers optimization problems defined over a network of nodes, where each node knows only part of the objective functions. We are motivated by… (more)

Subjects/Keywords: Distributed algorithms; optimization; control theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Doan, T. T. (2018). On the performance of distributed algorithms for network optimization problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100998

Chicago Manual of Style (16th Edition):

Doan, Thinh Thanh. “On the performance of distributed algorithms for network optimization problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/100998.

MLA Handbook (7th Edition):

Doan, Thinh Thanh. “On the performance of distributed algorithms for network optimization problems.” 2018. Web. 11 Apr 2021.

Vancouver:

Doan TT. On the performance of distributed algorithms for network optimization problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/100998.

Council of Science Editors:

Doan TT. On the performance of distributed algorithms for network optimization problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100998


University of Illinois – Urbana-Champaign

14. Wilson, Craig A. Adaptive sequential optimization with applications to machine learning.

Degree: PhD, Electrical & Computer Engr, 2016, University of Illinois – Urbana-Champaign

 The focus of this thesis is on solving a sequence of optimization problems that change over time in a structured manner. This type of problem… (more)

Subjects/Keywords: convex optimization; adaptive algorithms sequential machine learning; machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wilson, C. A. (2016). Adaptive sequential optimization with applications to machine learning. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/90876

Chicago Manual of Style (16th Edition):

Wilson, Craig A. “Adaptive sequential optimization with applications to machine learning.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/90876.

MLA Handbook (7th Edition):

Wilson, Craig A. “Adaptive sequential optimization with applications to machine learning.” 2016. Web. 11 Apr 2021.

Vancouver:

Wilson CA. Adaptive sequential optimization with applications to machine learning. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/90876.

Council of Science Editors:

Wilson CA. Adaptive sequential optimization with applications to machine learning. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/90876


University of Illinois – Urbana-Champaign

15. Kairouz, Peter. The fundamental limits of statistical data privacy.

Degree: PhD, Electrical & Computer Engr, 2016, University of Illinois – Urbana-Champaign

 The Internet is shaping our daily lives. On the one hand, social networks like Facebook and Twitter allow people to share their precious moments and… (more)

Subjects/Keywords: Privacy; Information Theory; Data Privacy; Statistics; Multi-Party Computation; Security; Local Differential Privacy; Privacy-Preserving Machine Learning Algorithms; Information Theoretic Utilities; f-Divergence; Mutual Information; Statistical Inference; Hypothesis Testing; Estimation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kairouz, P. (2016). The fundamental limits of statistical data privacy. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92686

Chicago Manual of Style (16th Edition):

Kairouz, Peter. “The fundamental limits of statistical data privacy.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/92686.

MLA Handbook (7th Edition):

Kairouz, Peter. “The fundamental limits of statistical data privacy.” 2016. Web. 11 Apr 2021.

Vancouver:

Kairouz P. The fundamental limits of statistical data privacy. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/92686.

Council of Science Editors:

Kairouz P. The fundamental limits of statistical data privacy. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92686


University of Illinois – Urbana-Champaign

16. Johnstone, Patrick Royce. Accelerated first-order optimization methods using inertia and error bounds.

Degree: PhD, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

 Optimization is an important discipline of applied mathematics with far-reaching applications. Optimization algorithms often form the backbone of practical systems in machine learning, image processing,… (more)

Subjects/Keywords: Optimization; Convergence analysis; Accelerated first-order methods; Subgradient methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Johnstone, P. R. (2017). Accelerated first-order optimization methods using inertia and error bounds. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97298

Chicago Manual of Style (16th Edition):

Johnstone, Patrick Royce. “Accelerated first-order optimization methods using inertia and error bounds.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/97298.

MLA Handbook (7th Edition):

Johnstone, Patrick Royce. “Accelerated first-order optimization methods using inertia and error bounds.” 2017. Web. 11 Apr 2021.

Vancouver:

Johnstone PR. Accelerated first-order optimization methods using inertia and error bounds. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/97298.

Council of Science Editors:

Johnstone PR. Accelerated first-order optimization methods using inertia and error bounds. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97298


University of Illinois – Urbana-Champaign

17. Zhao, Tingting. A service-driven approach to assist water management during extreme events.

Degree: PhD, Civil Engineering, 2017, University of Illinois – Urbana-Champaign

 Water shortages and flooding have caused large property losses and endangered human lives in many areas. Rapid and informed response is needed to ensure effective… (more)

Subjects/Keywords: Service-driven; Drought; Flooding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhao, T. (2017). A service-driven approach to assist water management during extreme events. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98122

Chicago Manual of Style (16th Edition):

Zhao, Tingting. “A service-driven approach to assist water management during extreme events.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/98122.

MLA Handbook (7th Edition):

Zhao, Tingting. “A service-driven approach to assist water management during extreme events.” 2017. Web. 11 Apr 2021.

Vancouver:

Zhao T. A service-driven approach to assist water management during extreme events. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/98122.

Council of Science Editors:

Zhao T. A service-driven approach to assist water management during extreme events. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98122


University of Illinois – Urbana-Champaign

18. Kowshik, Hemant J. Information aggregation in sensor networks.

Degree: PhD, 1200, 2011, University of Illinois – Urbana-Champaign

 In many sensor network applications, one is interested only in computing some relevant it{function} of the sensor measurements. In this thesis, we study optimal strategies… (more)

Subjects/Keywords: In-network Computation; Sensor Networks; Function Computation; Communication Complexity; Threshold Functions; Zero-error Block Computation; Sequential Decision-making; Checking Connectivity; Distributed Computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kowshik, H. J. (2011). Information aggregation in sensor networks. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24189

Chicago Manual of Style (16th Edition):

Kowshik, Hemant J. “Information aggregation in sensor networks.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/24189.

MLA Handbook (7th Edition):

Kowshik, Hemant J. “Information aggregation in sensor networks.” 2011. Web. 11 Apr 2021.

Vancouver:

Kowshik HJ. Information aggregation in sensor networks. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/24189.

Council of Science Editors:

Kowshik HJ. Information aggregation in sensor networks. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24189


University of Illinois – Urbana-Champaign

19. Bhatti, Shahzad Fazal. Scalable centralized and distributed spectral clustering.

Degree: PhD, Industrial Engineering, 2018, University of Illinois – Urbana-Champaign

 Spectral clustering approaches have led to well-accepted algorithms for finding accurate clusters in a given dataset. However, their application to large-scale datasets has been hindered… (more)

Subjects/Keywords: Clustering algorithms; community detection; graph partitioning; random walk; distributed algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bhatti, S. F. (2018). Scalable centralized and distributed spectral clustering. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101769

Chicago Manual of Style (16th Edition):

Bhatti, Shahzad Fazal. “Scalable centralized and distributed spectral clustering.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/101769.

MLA Handbook (7th Edition):

Bhatti, Shahzad Fazal. “Scalable centralized and distributed spectral clustering.” 2018. Web. 11 Apr 2021.

Vancouver:

Bhatti SF. Scalable centralized and distributed spectral clustering. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/101769.

Council of Science Editors:

Bhatti SF. Scalable centralized and distributed spectral clustering. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101769


University of Illinois – Urbana-Champaign

20. Yang, Pengkun. Polynomial methods in statistical inference: Theory and practice.

Degree: PhD, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 Recent advances in genetics, computer vision, and text mining are accompanied by analyzing data coming from a large domain, where the domain size is comparable… (more)

Subjects/Keywords: polynomial methods; statistical inference; minimax estimation; polynomial approximation; method of moments; efficient algorithm; fundamental limits

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yang, P. (2018). Polynomial methods in statistical inference: Theory and practice. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102774

Chicago Manual of Style (16th Edition):

Yang, Pengkun. “Polynomial methods in statistical inference: Theory and practice.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/102774.

MLA Handbook (7th Edition):

Yang, Pengkun. “Polynomial methods in statistical inference: Theory and practice.” 2018. Web. 11 Apr 2021.

Vancouver:

Yang P. Polynomial methods in statistical inference: Theory and practice. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/102774.

Council of Science Editors:

Yang P. Polynomial methods in statistical inference: Theory and practice. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102774


University of Illinois – Urbana-Champaign

21. Gade, Shripad. Accuracy-aware privacy mechanisms for distributed computation.

Degree: PhD, Electrical & Computer Engr, 2020, University of Illinois – Urbana-Champaign

 Distributed computing systems involve a network of devices or agents that use locally stored private information to solve a common problem. Distributed algorithms fundamentally require… (more)

Subjects/Keywords: Privacy; Non-identifiability; Distributed Computation; Network Games; Distributed Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gade, S. (2020). Accuracy-aware privacy mechanisms for distributed computation. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/109398

Chicago Manual of Style (16th Edition):

Gade, Shripad. “Accuracy-aware privacy mechanisms for distributed computation.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/109398.

MLA Handbook (7th Edition):

Gade, Shripad. “Accuracy-aware privacy mechanisms for distributed computation.” 2020. Web. 11 Apr 2021.

Vancouver:

Gade S. Accuracy-aware privacy mechanisms for distributed computation. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/109398.

Council of Science Editors:

Gade S. Accuracy-aware privacy mechanisms for distributed computation. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/109398


University of Illinois – Urbana-Champaign

22. Hou, I-Hong. Supporting delay guarantees over unreliable wireless channels.

Degree: PhD, 0112, 2012, University of Illinois – Urbana-Champaign

 Many emerging applications of networks require delay guarantees for packet deliveries. It is particularly challenging to provide services for these applications over wireless channels, since… (more)

Subjects/Keywords: Wireless Networks; Delays; Scheduling; Admission Control; Utility Maximization; Broadcast; Network Coding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hou, I. (2012). Supporting delay guarantees over unreliable wireless channels. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29821

Chicago Manual of Style (16th Edition):

Hou, I-Hong. “Supporting delay guarantees over unreliable wireless channels.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/29821.

MLA Handbook (7th Edition):

Hou, I-Hong. “Supporting delay guarantees over unreliable wireless channels.” 2012. Web. 11 Apr 2021.

Vancouver:

Hou I. Supporting delay guarantees over unreliable wireless channels. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/29821.

Council of Science Editors:

Hou I. Supporting delay guarantees over unreliable wireless channels. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29821


University of Illinois – Urbana-Champaign

23. Maginnis, Peter A. Variance-reduced simulation of lattice Markov chains.

Degree: PhD, Mechanical Engineering, 2018, University of Illinois – Urbana-Champaign

 The focus of this dissertation is on reducing the cost of Monte Carlo estimation for lattice-valued Markov chains. We achieve this goal by manipulating the… (more)

Subjects/Keywords: Markov chains; variance-reduction; antithetic simulation; Monte Carlo

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Maginnis, P. A. (2018). Variance-reduced simulation of lattice Markov chains. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101032

Chicago Manual of Style (16th Edition):

Maginnis, Peter A. “Variance-reduced simulation of lattice Markov chains.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/101032.

MLA Handbook (7th Edition):

Maginnis, Peter A. “Variance-reduced simulation of lattice Markov chains.” 2018. Web. 11 Apr 2021.

Vancouver:

Maginnis PA. Variance-reduced simulation of lattice Markov chains. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/101032.

Council of Science Editors:

Maginnis PA. Variance-reduced simulation of lattice Markov chains. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101032


University of Illinois – Urbana-Champaign

24. Yang, James Yifei. Distributed content collection and rank aggregation.

Degree: PhD, Electrical & Computer Engr, 2016, University of Illinois – Urbana-Champaign

 Despite the substantial literature on recommendation systems, there have been few studies in distributed settings, where peers provide recommendations locally. Motivated by word of mouth… (more)

Subjects/Keywords: Rank Aggregation; Score Aggregation; Mean Field; Scaling; Recommendation System; Peer-to-Peer; Content Collection; Independent Crossover Model; Plackett-Luce; Zipf; Independent Crossover Model; Clustering; Multi-Cluster; Multi-Cluster; Hypothesis Testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yang, J. Y. (2016). Distributed content collection and rank aggregation. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95281

Chicago Manual of Style (16th Edition):

Yang, James Yifei. “Distributed content collection and rank aggregation.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/95281.

MLA Handbook (7th Edition):

Yang, James Yifei. “Distributed content collection and rank aggregation.” 2016. Web. 11 Apr 2021.

Vancouver:

Yang JY. Distributed content collection and rank aggregation. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/95281.

Council of Science Editors:

Yang JY. Distributed content collection and rank aggregation. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95281


University of Illinois – Urbana-Champaign

25. Choi, Wooseok. Design of energy-efficient high-speed wireline transceiver.

Degree: PhD, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

 Energy efficiency has become the most important performance metric of integrated circuits used in many applications ranging from mobile devices to high-performance processors. The power… (more)

Subjects/Keywords: Energy efficiency; Serial link; High-speed input/output (I/O); Wireline transceiver; Near-threshold voltage design; Burst-mode clock and data recovery (CDR); Rapid on/off link

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Choi, W. (2017). Design of energy-efficient high-speed wireline transceiver. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97564

Chicago Manual of Style (16th Edition):

Choi, Wooseok. “Design of energy-efficient high-speed wireline transceiver.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/97564.

MLA Handbook (7th Edition):

Choi, Wooseok. “Design of energy-efficient high-speed wireline transceiver.” 2017. Web. 11 Apr 2021.

Vancouver:

Choi W. Design of energy-efficient high-speed wireline transceiver. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/97564.

Council of Science Editors:

Choi W. Design of energy-efficient high-speed wireline transceiver. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97564


University of Illinois – Urbana-Champaign

26. Etesami, Seyedjalal. Causal structure of networks of stochastic processes.

Degree: PhD, Industrial Engineering, 2017, University of Illinois – Urbana-Champaign

 We propose different approaches to infer causal influences between agents in a network using only observed time series. This includes graphical models to depict causal… (more)

Subjects/Keywords: Causal learning; Dynamical systems; Stochastic systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Etesami, S. (2017). Causal structure of networks of stochastic processes. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98151

Chicago Manual of Style (16th Edition):

Etesami, Seyedjalal. “Causal structure of networks of stochastic processes.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/98151.

MLA Handbook (7th Edition):

Etesami, Seyedjalal. “Causal structure of networks of stochastic processes.” 2017. Web. 11 Apr 2021.

Vancouver:

Etesami S. Causal structure of networks of stochastic processes. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/98151.

Council of Science Editors:

Etesami S. Causal structure of networks of stochastic processes. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98151

27. Brenner, Michael. A Lyapunov analysis of LRU.

Degree: MS, Electrical & Computer Engr, 2020, University of Illinois – Urbana-Champaign

 Caches are segments of memory that store requested information in a system subject to a set of decision rules, defined as the caching algorithm. One… (more)

Subjects/Keywords: Lyapunov; Control Thoery; Stochastic Systems; Cache; LRU; Least recently used; Markov Chain; TTL

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Brenner, M. (2020). A Lyapunov analysis of LRU. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/107992

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Brenner, Michael. “A Lyapunov analysis of LRU.” 2020. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/107992.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Brenner, Michael. “A Lyapunov analysis of LRU.” 2020. Web. 11 Apr 2021.

Vancouver:

Brenner M. A Lyapunov analysis of LRU. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/107992.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Brenner M. A Lyapunov analysis of LRU. [Thesis]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/107992

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

28. Liang, Shiyu. Why deep neural networks for function approximation.

Degree: MS, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

 Recently there has been much interest in understanding why deep neural networks are preferred to shallow networks. We show that, for a large class of… (more)

Subjects/Keywords: Neural networks; Deep learning

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liang, S. (2017). Why deep neural networks for function approximation. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/99417

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Liang, Shiyu. “Why deep neural networks for function approximation.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/99417.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Liang, Shiyu. “Why deep neural networks for function approximation.” 2017. Web. 11 Apr 2021.

Vancouver:

Liang S. Why deep neural networks for function approximation. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/99417.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liang S. Why deep neural networks for function approximation. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/99417

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

29. Maguluri, Siva Theja. Optimal scheduling algorithms for ad hoc wireless networks.

Degree: MS, 1200, 2011, University of Illinois – Urbana-Champaign

 It is well known that the MaxWeight scheduling algorithm is throughput-optimal in wireless networks. However, its complexity is exponential in the number of links in… (more)

Subjects/Keywords: Adhoc Networks; Scheduling; Wireless; Lyapunov; optimal

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Maguluri, S. T. (2011). Optimal scheduling algorithms for ad hoc wireless networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24097

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Maguluri, Siva Theja. “Optimal scheduling algorithms for ad hoc wireless networks.” 2011. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/24097.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Maguluri, Siva Theja. “Optimal scheduling algorithms for ad hoc wireless networks.” 2011. Web. 11 Apr 2021.

Vancouver:

Maguluri ST. Optimal scheduling algorithms for ad hoc wireless networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/24097.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Maguluri ST. Optimal scheduling algorithms for ad hoc wireless networks. [Thesis]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24097

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

30. Leconte, Mathieu. On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks.

Degree: MS, 1200, 2010, University of Illinois – Urbana-Champaign

 Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS… (more)

Subjects/Keywords: Greedy Maximal Scheduling; Longest Queue First; wireless network; throughput optimality; throughput efficiency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Leconte, M. (2010). On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/14629

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Leconte, Mathieu. “On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks.” 2010. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/14629.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Leconte, Mathieu. “On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks.” 2010. Web. 11 Apr 2021.

Vancouver:

Leconte M. On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2010. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/14629.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Leconte M. On the throughput efficiency of greedy maximal scheduling in wireless ad hoc networks. [Thesis]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/14629

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3]

.