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:"Indian Institute of Science" +contributor:("Bhatnagar, Shalabh"). Showing records 1 – 18 of 18 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Indian Institute of Science

1. Abdulla, Mohammed Shahid. Simulation Based Algorithms For Markov Decision Process And Stochastic Optimization.

Degree: 2008, Indian Institute of Science

 In Chapter 2, we propose several two-timescale simulation-based actor-critic algorithms for solution of infinite horizon Markov Decision Processes (MDPs) with finite state-space under the average… (more)

Subjects/Keywords: Markov Processes - Data Processing; Algorithms; Simulation; Markov Decision Processes (MDPs); Infinite Horizon Markov Decision Processes; Finite Horizon Markov Decision Processes; Stochastic Approximation - Algorithms; Simultaneous Perturbation Stochastic Approximation (SPSA); Network Flow-Control; FH-MDP Algorithms; Stochastic Optimization; Reinforcement Learning Algorithms; Computational Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abdulla, M. S. (2008). Simulation Based Algorithms For Markov Decision Process And Stochastic Optimization. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/812

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):

Abdulla, Mohammed Shahid. “Simulation Based Algorithms For Markov Decision Process And Stochastic Optimization.” 2008. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://hdl.handle.net/2005/812.

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

MLA Handbook (7th Edition):

Abdulla, Mohammed Shahid. “Simulation Based Algorithms For Markov Decision Process And Stochastic Optimization.” 2008. Web. 19 Jul 2019.

Vancouver:

Abdulla MS. Simulation Based Algorithms For Markov Decision Process And Stochastic Optimization. [Internet] [Thesis]. Indian Institute of Science; 2008. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2005/812.

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

Council of Science Editors:

Abdulla MS. Simulation Based Algorithms For Markov Decision Process And Stochastic Optimization. [Thesis]. Indian Institute of Science; 2008. Available from: http://hdl.handle.net/2005/812

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


Indian Institute of Science

2. Prashanth, L A. Resource Allocation for Sequential Decision Making Under Uncertainaty : Studies in Vehicular Traffic Control, Service Systems, Sensor Networks and Mechanism Design.

Degree: 2013, Indian Institute of Science

 A fundamental question in a sequential decision making setting under uncertainty is “how to allocate resources amongst competing entities so as to maximize the rewards… (more)

Subjects/Keywords: Vehicular Traffic Control; Service Systems; Sensor Networks; Mechanism Design; Traffic Signal Control - Q-Learning; Traffic Signal Control; Signal Control - Threshold Tuning; Traffic Light Control Algorithm; Adaptive Labor Staffing; Sleep-Wake Scheduling Algorithms; Reinforcement Learning; Vehicular Control; Graded Signal Control; Adaptive Sleep–wake Control; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prashanth, L. A. (2013). Resource Allocation for Sequential Decision Making Under Uncertainaty : Studies in Vehicular Traffic Control, Service Systems, Sensor Networks and Mechanism Design. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2810

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):

Prashanth, L A. “Resource Allocation for Sequential Decision Making Under Uncertainaty : Studies in Vehicular Traffic Control, Service Systems, Sensor Networks and Mechanism Design.” 2013. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://hdl.handle.net/2005/2810.

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

MLA Handbook (7th Edition):

Prashanth, L A. “Resource Allocation for Sequential Decision Making Under Uncertainaty : Studies in Vehicular Traffic Control, Service Systems, Sensor Networks and Mechanism Design.” 2013. Web. 19 Jul 2019.

Vancouver:

Prashanth LA. Resource Allocation for Sequential Decision Making Under Uncertainaty : Studies in Vehicular Traffic Control, Service Systems, Sensor Networks and Mechanism Design. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2005/2810.

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

Council of Science Editors:

Prashanth LA. Resource Allocation for Sequential Decision Making Under Uncertainaty : Studies in Vehicular Traffic Control, Service Systems, Sensor Networks and Mechanism Design. [Thesis]. Indian Institute of Science; 2013. Available from: http://hdl.handle.net/2005/2810

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


Indian Institute of Science

3. Prasad, H L. Algorithms For Stochastic Games And Service Systems.

Degree: 2012, Indian Institute of Science

 This thesis is organized into two parts, one for my main area of research in the field of stochastic games, and the other for my… (more)

Subjects/Keywords: Algorithms; Stochastic Games; Stochastic Games - Algorithms; Nash Equilibrium Computation; Gradient Descent Schemes; Markov Decision Processes; Service Systems - Labour Costs - Modelling; Labour Staffing Optimization - Algorithms; Markov Cost Process; Labour Costs - Modelling; Labor Cost Optimization; Nash Equilibria; Game Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prasad, H. L. (2012). Algorithms For Stochastic Games And Service Systems. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2301

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):

Prasad, H L. “Algorithms For Stochastic Games And Service Systems.” 2012. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://hdl.handle.net/2005/2301.

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

MLA Handbook (7th Edition):

Prasad, H L. “Algorithms For Stochastic Games And Service Systems.” 2012. Web. 19 Jul 2019.

Vancouver:

Prasad HL. Algorithms For Stochastic Games And Service Systems. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2005/2301.

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

Council of Science Editors:

Prasad HL. Algorithms For Stochastic Games And Service Systems. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/2301

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


Indian Institute of Science

4. Prasad, H L. Algorithms For Stochastic Games And Service Systems.

Degree: 2012, Indian Institute of Science

 This thesis is organized into two parts, one for my main area of research in the field of stochastic games, and the other for my… (more)

Subjects/Keywords: Algorithms; Stochastic Games; Stochastic Games - Algorithms; Nash Equilibrium Computation; Gradient Descent Schemes; Markov Decision Processes; Service Systems - Labour Costs - Modelling; Labour Staffing Optimization - Algorithms; Markov Cost Process; Labour Costs - Modelling; Labor Cost Optimization; Nash Equilibria; Game Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prasad, H. L. (2012). Algorithms For Stochastic Games And Service Systems. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2301 ; http://etd.ncsi.iisc.ernet.in/abstracts/2961/G25466-Abs.pdf

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):

Prasad, H L. “Algorithms For Stochastic Games And Service Systems.” 2012. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/handle/2005/2301 ; http://etd.ncsi.iisc.ernet.in/abstracts/2961/G25466-Abs.pdf.

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

MLA Handbook (7th Edition):

Prasad, H L. “Algorithms For Stochastic Games And Service Systems.” 2012. Web. 19 Jul 2019.

Vancouver:

Prasad HL. Algorithms For Stochastic Games And Service Systems. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/handle/2005/2301 ; http://etd.ncsi.iisc.ernet.in/abstracts/2961/G25466-Abs.pdf.

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

Council of Science Editors:

Prasad HL. Algorithms For Stochastic Games And Service Systems. [Thesis]. Indian Institute of Science; 2012. Available from: http://etd.iisc.ernet.in/handle/2005/2301 ; http://etd.ncsi.iisc.ernet.in/abstracts/2961/G25466-Abs.pdf

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


Indian Institute of Science

5. Prabuchandran, K J. Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control.

Degree: 2016, Indian Institute of Science

 Many sequential decision making problems under uncertainty arising in engineering, science and economics are often modelled as Markov Decision Processes (MDPs). In the setting of… (more)

Subjects/Keywords: Wireless Sensor Networks; Road Traffic Control; Reinforcement Learning Algorithms; Markov Decision Processes (MDPs); Sensor Networks; Traffic Signal Control (TSC); Reinforcement Learning; Energy Harvesting Sensor Nodes; Stochastic Approximation; Grassmannian Search; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prabuchandran, K. J. (2016). Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2664 ; http://etd.ncsi.iisc.ernet.in/abstracts/3481/G27183-Abs.pdf

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):

Prabuchandran, K J. “Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control.” 2016. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/handle/2005/2664 ; http://etd.ncsi.iisc.ernet.in/abstracts/3481/G27183-Abs.pdf.

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

MLA Handbook (7th Edition):

Prabuchandran, K J. “Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control.” 2016. Web. 19 Jul 2019.

Vancouver:

Prabuchandran KJ. Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/handle/2005/2664 ; http://etd.ncsi.iisc.ernet.in/abstracts/3481/G27183-Abs.pdf.

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

Council of Science Editors:

Prabuchandran KJ. Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control. [Thesis]. Indian Institute of Science; 2016. Available from: http://etd.iisc.ernet.in/handle/2005/2664 ; http://etd.ncsi.iisc.ernet.in/abstracts/3481/G27183-Abs.pdf

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


Indian Institute of Science

6. Prabuchandran, K J. Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control.

Degree: 2016, Indian Institute of Science

 Many sequential decision making problems under uncertainty arising in engineering, science and economics are often modelled as Markov Decision Processes (MDPs). In the setting of… (more)

Subjects/Keywords: Wireless Sensor Networks; Road Traffic Control; Reinforcement Learning Algorithms; Markov Decision Processes (MDPs); Sensor Networks; Traffic Signal Control (TSC); Reinforcement Learning; Energy Harvesting Sensor Nodes; Stochastic Approximation; Grassmannian Search; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prabuchandran, K. J. (2016). Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2664

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):

Prabuchandran, K J. “Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control.” 2016. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://hdl.handle.net/2005/2664.

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

MLA Handbook (7th Edition):

Prabuchandran, K J. “Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control.” 2016. Web. 19 Jul 2019.

Vancouver:

Prabuchandran KJ. Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2005/2664.

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

Council of Science Editors:

Prabuchandran KJ. Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control. [Thesis]. Indian Institute of Science; 2016. Available from: http://hdl.handle.net/2005/2664

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


Indian Institute of Science

7. Joseph, Ajin George. Optimization Algorithms for Deterministic, Stochastic and Reinforcement Learning Settings.

Degree: 2017, Indian Institute of Science

 Optimization is a very important field with diverse applications in physical, social and biological sciences and in various areas of engineering. It appears widely in… (more)

Subjects/Keywords: Optimization Algorithms; Reinforcement Learning; Machine Learning; Markov Decision Process; Stochastic Approximation Algorithm; Stochastic Optimization; Cross Entropy Method; Stochastic Global Optimization; Cross Entropy Optimization Method; Quantile Estimation; Continuous Optimization; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Joseph, A. G. (2017). Optimization Algorithms for Deterministic, Stochastic and Reinforcement Learning Settings. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3645 ; http://etd.iisc.ernet.in/abstracts/4515/G28470-Abs.pdf

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):

Joseph, Ajin George. “Optimization Algorithms for Deterministic, Stochastic and Reinforcement Learning Settings.” 2017. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/2005/3645 ; http://etd.iisc.ernet.in/abstracts/4515/G28470-Abs.pdf.

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

MLA Handbook (7th Edition):

Joseph, Ajin George. “Optimization Algorithms for Deterministic, Stochastic and Reinforcement Learning Settings.” 2017. Web. 19 Jul 2019.

Vancouver:

Joseph AG. Optimization Algorithms for Deterministic, Stochastic and Reinforcement Learning Settings. [Internet] [Thesis]. Indian Institute of Science; 2017. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/2005/3645 ; http://etd.iisc.ernet.in/abstracts/4515/G28470-Abs.pdf.

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

Council of Science Editors:

Joseph AG. Optimization Algorithms for Deterministic, Stochastic and Reinforcement Learning Settings. [Thesis]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ernet.in/2005/3645 ; http://etd.iisc.ernet.in/abstracts/4515/G28470-Abs.pdf

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


Indian Institute of Science

8. Lakshmanan, K. Online Learning and Simulation Based Algorithms for Stochastic Optimization.

Degree: 2012, Indian Institute of Science

 In many optimization problems, the relationship between the objective and parameters is not known. The objective function itself may be stochastic such as a long-run… (more)

Subjects/Keywords: Stochastic Approximation Algorithms; Stochastic Optimization; Markov Decision Process; Reinforcement Learning Algorithm; Queueing Networks; Queuing Theory; Quasi-Newton Stochastic Approximation Algorithm; Online Q-Learning Algorithm; Online Actor-Critic Algorithm; Markov Decision Processes; Q-learning Algorithm; Linear Function Approximation; Quasi-Newton Smoothed Functional Algorithms; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lakshmanan, K. (2012). Online Learning and Simulation Based Algorithms for Stochastic Optimization. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/3245

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):

Lakshmanan, K. “Online Learning and Simulation Based Algorithms for Stochastic Optimization.” 2012. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://hdl.handle.net/2005/3245.

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

MLA Handbook (7th Edition):

Lakshmanan, K. “Online Learning and Simulation Based Algorithms for Stochastic Optimization.” 2012. Web. 19 Jul 2019.

Vancouver:

Lakshmanan K. Online Learning and Simulation Based Algorithms for Stochastic Optimization. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2005/3245.

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

Council of Science Editors:

Lakshmanan K. Online Learning and Simulation Based Algorithms for Stochastic Optimization. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/3245

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


Indian Institute of Science

9. Sindhu, P R. Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks.

Degree: 2014, Indian Institute of Science

 In this thesis, we consider stochastic systems which arise in different real-world application contexts. The first problem we consider is based on product adoption and… (more)

Subjects/Keywords: Stochastic Control; Optimal Pricing; Dynamic Pricing; Energy Harvesting Sensor Networks; Product Pricing; Energy Sharing; Diffusion Models; Markov Decision Processes; Product Pricing Algorithms; Energy Sharing Algorithms; Q-learning; Energy Harvesting Sensor Nodes; Optimal Pricing Policy; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sindhu, P. R. (2014). Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3505 ; http://etd.iisc.ernet.in/abstracts/4372/G26647-Abs.pdf

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):

Sindhu, P R. “Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks.” 2014. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/2005/3505 ; http://etd.iisc.ernet.in/abstracts/4372/G26647-Abs.pdf.

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

MLA Handbook (7th Edition):

Sindhu, P R. “Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks.” 2014. Web. 19 Jul 2019.

Vancouver:

Sindhu PR. Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks. [Internet] [Thesis]. Indian Institute of Science; 2014. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/2005/3505 ; http://etd.iisc.ernet.in/abstracts/4372/G26647-Abs.pdf.

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

Council of Science Editors:

Sindhu PR. Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks. [Thesis]. Indian Institute of Science; 2014. Available from: http://etd.iisc.ernet.in/2005/3505 ; http://etd.iisc.ernet.in/abstracts/4372/G26647-Abs.pdf

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


Indian Institute of Science

10. Reddy, Danda Sai Koti. Stochastic Newton Methods With Enhanced Hessian Estimation.

Degree: 2017, Indian Institute of Science

 Optimization problems involving uncertainties are common in a variety of engineering disciplines such as transportation systems, manufacturing, communication networks, healthcare and finance. The large number… (more)

Subjects/Keywords: Stochastic Newton Methods; Hessian Estimation; Simultaneous Perturbation Stochastic Approximation (SPSA); Random Directions Stochastic Approximation (RDSA); Finite-difference Stochastic Approximation (FDSA); Hessian Estimation Scheme; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Reddy, D. S. K. (2017). Stochastic Newton Methods With Enhanced Hessian Estimation. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3582 ; http://etd.iisc.ernet.in/abstracts/4450/G28169-Abs.pdf

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):

Reddy, Danda Sai Koti. “Stochastic Newton Methods With Enhanced Hessian Estimation.” 2017. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/2005/3582 ; http://etd.iisc.ernet.in/abstracts/4450/G28169-Abs.pdf.

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

MLA Handbook (7th Edition):

Reddy, Danda Sai Koti. “Stochastic Newton Methods With Enhanced Hessian Estimation.” 2017. Web. 19 Jul 2019.

Vancouver:

Reddy DSK. Stochastic Newton Methods With Enhanced Hessian Estimation. [Internet] [Thesis]. Indian Institute of Science; 2017. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/2005/3582 ; http://etd.iisc.ernet.in/abstracts/4450/G28169-Abs.pdf.

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

Council of Science Editors:

Reddy DSK. Stochastic Newton Methods With Enhanced Hessian Estimation. [Thesis]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ernet.in/2005/3582 ; http://etd.iisc.ernet.in/abstracts/4450/G28169-Abs.pdf

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


Indian Institute of Science

11. Ranganath, B N. Scalable Sprase Bayesian Nonparametric and Matrix Tri-factorization Models for Text Mining Applications.

Degree: 2017, Indian Institute of Science

 Hierarchical Bayesian Models and Matrix factorization methods provide an unsupervised way to learn latent components of data from the grouped or sequence data. For example,… (more)

Subjects/Keywords: Scalable Sprase Bayesian; Matrix Tri-factorization Model; Mining Application - Texts; Hierarchical Bayesian Models; Sparse Entity Resolution Model (SERM); Sparse Topical Analysis; Scalable Focussed Entity Resolution; Block Exchangeable Model (BEM); Sequential Grouped Data; Dirichlet Process; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ranganath, B. N. (2017). Scalable Sprase Bayesian Nonparametric and Matrix Tri-factorization Models for Text Mining Applications. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3593 ; http://etd.iisc.ernet.in/abstracts/4462/G28208-Abs.pdf

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):

Ranganath, B N. “Scalable Sprase Bayesian Nonparametric and Matrix Tri-factorization Models for Text Mining Applications.” 2017. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/2005/3593 ; http://etd.iisc.ernet.in/abstracts/4462/G28208-Abs.pdf.

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

MLA Handbook (7th Edition):

Ranganath, B N. “Scalable Sprase Bayesian Nonparametric and Matrix Tri-factorization Models for Text Mining Applications.” 2017. Web. 19 Jul 2019.

Vancouver:

Ranganath BN. Scalable Sprase Bayesian Nonparametric and Matrix Tri-factorization Models for Text Mining Applications. [Internet] [Thesis]. Indian Institute of Science; 2017. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/2005/3593 ; http://etd.iisc.ernet.in/abstracts/4462/G28208-Abs.pdf.

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

Council of Science Editors:

Ranganath BN. Scalable Sprase Bayesian Nonparametric and Matrix Tri-factorization Models for Text Mining Applications. [Thesis]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ernet.in/2005/3593 ; http://etd.iisc.ernet.in/abstracts/4462/G28208-Abs.pdf

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


Indian Institute of Science

12. Ramaswamy, Arunselvan. Stochastic Approximation Algorithms with Set-valued Dynamics : Theory and Applications.

Degree: 2016, Indian Institute of Science

 Stochastic approximation algorithms encompass a class of iterative schemes that converge to a sought value through a series of successive approximations. Such algorithms converge even… (more)

Subjects/Keywords: Stochastic Approximation Algorithms; Set-Valued Dynamical Systems; Stochastic Recursive Inclusions; Stability Theorem; Controlled Markov Process; Borkar-Meyn Theorem; Stochastic Approximations; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ramaswamy, A. (2016). Stochastic Approximation Algorithms with Set-valued Dynamics : Theory and Applications. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3788 ; http://etd.iisc.ernet.in/abstracts/4659/G28523-Abs.pdf

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):

Ramaswamy, Arunselvan. “Stochastic Approximation Algorithms with Set-valued Dynamics : Theory and Applications.” 2016. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/2005/3788 ; http://etd.iisc.ernet.in/abstracts/4659/G28523-Abs.pdf.

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

MLA Handbook (7th Edition):

Ramaswamy, Arunselvan. “Stochastic Approximation Algorithms with Set-valued Dynamics : Theory and Applications.” 2016. Web. 19 Jul 2019.

Vancouver:

Ramaswamy A. Stochastic Approximation Algorithms with Set-valued Dynamics : Theory and Applications. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/2005/3788 ; http://etd.iisc.ernet.in/abstracts/4659/G28523-Abs.pdf.

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

Council of Science Editors:

Ramaswamy A. Stochastic Approximation Algorithms with Set-valued Dynamics : Theory and Applications. [Thesis]. Indian Institute of Science; 2016. Available from: http://etd.iisc.ernet.in/2005/3788 ; http://etd.iisc.ernet.in/abstracts/4659/G28523-Abs.pdf

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


Indian Institute of Science

13. Lakshminarayanan, Chandrashekar. Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application.

Degree: 2015, Indian Institute of Science

 Problems involving optimal sequential making in uncertain dynamic systems arise in domains such as engineering, science and economics. Such problems can often be cast in… (more)

Subjects/Keywords: Dynamic Programming (DP); Reinforcement Learning - Machine Learning; Markov Decision Process (MDP); Bellman Equation CBE; Machine Learning; Bellman Operator; Crowdsourcing; Approximate Linear Programming (ALP); Reinforcement Learning; Stochastic Approximation; Approximate Dynamic Programming (ADP); Approximate Linear Program; Linear Function Approximation (LFA); Reduced Linear Program (RLP); Generalized Reduced Linear Program (GRLP); Crowd Sourcing; Computer Science and Automation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lakshminarayanan, C. (2015). Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3963 ; http://etd.iisc.ernet.in/abstracts/4850/G27265-Abs.pdf

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):

Lakshminarayanan, Chandrashekar. “Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application.” 2015. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/2005/3963 ; http://etd.iisc.ernet.in/abstracts/4850/G27265-Abs.pdf.

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

MLA Handbook (7th Edition):

Lakshminarayanan, Chandrashekar. “Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application.” 2015. Web. 19 Jul 2019.

Vancouver:

Lakshminarayanan C. Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application. [Internet] [Thesis]. Indian Institute of Science; 2015. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/2005/3963 ; http://etd.iisc.ernet.in/abstracts/4850/G27265-Abs.pdf.

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

Council of Science Editors:

Lakshminarayanan C. Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application. [Thesis]. Indian Institute of Science; 2015. Available from: http://etd.iisc.ernet.in/2005/3963 ; http://etd.iisc.ernet.in/abstracts/4850/G27265-Abs.pdf

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


Indian Institute of Science

14. Dukkipati, Ambedkar. On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions.

Degree: 2006, Indian Institute of Science

 Kullback-Leibler relative-entropy or KL-entropy of P with respect to R defined as ∫xlnddPRdP , where P and R are probability measures on a measurable space… (more)

Subjects/Keywords: Information Theory; Entropy (Information theory); Shannon's Theory of Entropy; Kullback-Leiber Relative Entropy; Renyi Entropy; Tsallis Entropy; Relative-Entropy Minimization; Renyl's Receipe; Shannon Entropy; Entropies; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dukkipati, A. (2006). On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/353

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):

Dukkipati, Ambedkar. “On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions.” 2006. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://hdl.handle.net/2005/353.

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

MLA Handbook (7th Edition):

Dukkipati, Ambedkar. “On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions.” 2006. Web. 19 Jul 2019.

Vancouver:

Dukkipati A. On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions. [Internet] [Thesis]. Indian Institute of Science; 2006. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2005/353.

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

Council of Science Editors:

Dukkipati A. On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions. [Thesis]. Indian Institute of Science; 2006. Available from: http://hdl.handle.net/2005/353

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


Indian Institute of Science

15. Vaidya, Rahul. Online Optimization Of RED Routers.

Degree: 2004, Indian Institute of Science

Subjects/Keywords: Random Early Detection Routers; Computer Networks; Optimization Theory; Online Optimization; RED Routers; Random Early Detection; Diffserv Networks; Optimized RED Algorithm; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vaidya, R. (2004). Online Optimization Of RED Routers. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1134

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):

Vaidya, Rahul. “Online Optimization Of RED Routers.” 2004. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://hdl.handle.net/2005/1134.

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

MLA Handbook (7th Edition):

Vaidya, Rahul. “Online Optimization Of RED Routers.” 2004. Web. 19 Jul 2019.

Vancouver:

Vaidya R. Online Optimization Of RED Routers. [Internet] [Thesis]. Indian Institute of Science; 2004. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2005/1134.

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

Council of Science Editors:

Vaidya R. Online Optimization Of RED Routers. [Thesis]. Indian Institute of Science; 2004. Available from: http://hdl.handle.net/2005/1134

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


Indian Institute of Science

16. Patro, Rajesh Kumar. A Nonlinear Stochastic Optimization Framework For RED.

Degree: 2005, Indian Institute of Science

Subjects/Keywords: Packet Switching; Data Transmission Mode; Random Early Detection - Optimization Theory; RED - Random Early Detection; Stochastic Approximation; Internet - Quality of Service; Probabilistic Constrained Optimization; Simultaneous Perturbation Stochastic Approximation (SPSA); RED Parameters; Nonlinear Optimization; Stochastic Optimization; RIO; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Patro, R. K. (2005). A Nonlinear Stochastic Optimization Framework For RED. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1439

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):

Patro, Rajesh Kumar. “A Nonlinear Stochastic Optimization Framework For RED.” 2005. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://hdl.handle.net/2005/1439.

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

MLA Handbook (7th Edition):

Patro, Rajesh Kumar. “A Nonlinear Stochastic Optimization Framework For RED.” 2005. Web. 19 Jul 2019.

Vancouver:

Patro RK. A Nonlinear Stochastic Optimization Framework For RED. [Internet] [Thesis]. Indian Institute of Science; 2005. [cited 2019 Jul 19]. Available from: http://hdl.handle.net/2005/1439.

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

Council of Science Editors:

Patro RK. A Nonlinear Stochastic Optimization Framework For RED. [Thesis]. Indian Institute of Science; 2005. Available from: http://hdl.handle.net/2005/1439

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


Indian Institute of Science

17. Vaidya, Rahul. Online Optimization Of RED Routers.

Degree: 2004, Indian Institute of Science

Subjects/Keywords: Random Early Detection Routers; Computer Networks; Optimization Theory; Online Optimization; RED Routers; Random Early Detection; Diffserv Networks; Optimized RED Algorithm; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vaidya, R. (2004). Online Optimization Of RED Routers. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/1134 ; http://etd.ncsi.iisc.ernet.in/abstracts/1487/G18571-Abs.pdf

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):

Vaidya, Rahul. “Online Optimization Of RED Routers.” 2004. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/handle/2005/1134 ; http://etd.ncsi.iisc.ernet.in/abstracts/1487/G18571-Abs.pdf.

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

MLA Handbook (7th Edition):

Vaidya, Rahul. “Online Optimization Of RED Routers.” 2004. Web. 19 Jul 2019.

Vancouver:

Vaidya R. Online Optimization Of RED Routers. [Internet] [Thesis]. Indian Institute of Science; 2004. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/handle/2005/1134 ; http://etd.ncsi.iisc.ernet.in/abstracts/1487/G18571-Abs.pdf.

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

Council of Science Editors:

Vaidya R. Online Optimization Of RED Routers. [Thesis]. Indian Institute of Science; 2004. Available from: http://etd.iisc.ernet.in/handle/2005/1134 ; http://etd.ncsi.iisc.ernet.in/abstracts/1487/G18571-Abs.pdf

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


Indian Institute of Science

18. Patro, Rajesh Kumar. A Nonlinear Stochastic Optimization Framework For RED.

Degree: 2005, Indian Institute of Science

Subjects/Keywords: Packet Switching; Data Transmission Mode; Random Early Detection - Optimization Theory; RED - Random Early Detection; Stochastic Approximation; Internet - Quality of Service; Probabilistic Constrained Optimization; Simultaneous Perturbation Stochastic Approximation (SPSA); RED Parameters; Nonlinear Optimization; Stochastic Optimization; RIO; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Patro, R. K. (2005). A Nonlinear Stochastic Optimization Framework For RED. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/1439 ; http://etd.ncsi.iisc.ernet.in/abstracts/1856/G19726-Abs.pdf

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):

Patro, Rajesh Kumar. “A Nonlinear Stochastic Optimization Framework For RED.” 2005. Thesis, Indian Institute of Science. Accessed July 19, 2019. http://etd.iisc.ernet.in/handle/2005/1439 ; http://etd.ncsi.iisc.ernet.in/abstracts/1856/G19726-Abs.pdf.

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

MLA Handbook (7th Edition):

Patro, Rajesh Kumar. “A Nonlinear Stochastic Optimization Framework For RED.” 2005. Web. 19 Jul 2019.

Vancouver:

Patro RK. A Nonlinear Stochastic Optimization Framework For RED. [Internet] [Thesis]. Indian Institute of Science; 2005. [cited 2019 Jul 19]. Available from: http://etd.iisc.ernet.in/handle/2005/1439 ; http://etd.ncsi.iisc.ernet.in/abstracts/1856/G19726-Abs.pdf.

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

Council of Science Editors:

Patro RK. A Nonlinear Stochastic Optimization Framework For RED. [Thesis]. Indian Institute of Science; 2005. Available from: http://etd.iisc.ernet.in/handle/2005/1439 ; http://etd.ncsi.iisc.ernet.in/abstracts/1856/G19726-Abs.pdf

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

.