Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `+publisher:"University of Illinois – Urbana-Champaign" +contributor:("Nagi, Rakesh")`

.
Showing records 1 – 8 of
8 total matches.

▼ Search Limiters

University of Illinois – Urbana-Champaign

1. Natu, Shardul. GPU-based Lagrangian heuristic for multidimensional assignment problems with decomposable costs.

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

URL: http://hdl.handle.net/2142/101117

► Multidimensional assignment problem (MAP) is one of the many formulations of data association problem which categorizes data based on various data sources. A higher number…
(more)

Subjects/Keywords: Multidimensional assignment problem (MAP); Linear assignment problem (LAP); Graphics processing unit (GPU); Lagrangian relaxation.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Natu, S. (2018). GPU-based Lagrangian heuristic for multidimensional assignment problems with decomposable costs. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101117

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Natu, Shardul. “GPU-based Lagrangian heuristic for multidimensional assignment problems with decomposable costs.” 2018. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/101117.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Natu, Shardul. “GPU-based Lagrangian heuristic for multidimensional assignment problems with decomposable costs.” 2018. Web. 11 Apr 2021.

Vancouver:

Natu S. GPU-based Lagrangian heuristic for multidimensional assignment problems with decomposable costs. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/101117.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Natu S. GPU-based Lagrangian heuristic for multidimensional assignment problems with decomposable costs. [Thesis]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101117

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

2. Narasingaraj, Harish Balaji. Optimizing smoothing parameters for the triple exponential forecasting model.

Degree: MS, Industrial Engineering, 2016, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/90834

► Exponential smoothing has always been a popular topic of research in forecasting. The triple exponential smoothing in particular involves modeling a function that is a…
(more)

Subjects/Keywords: Holt Winters; Triple Exponential Smoothing parameters; M3 Competition

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Narasingaraj, H. B. (2016). Optimizing smoothing parameters for the triple exponential forecasting model. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/90834

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Narasingaraj, Harish Balaji. “Optimizing smoothing parameters for the triple exponential forecasting model.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/90834.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Narasingaraj, Harish Balaji. “Optimizing smoothing parameters for the triple exponential forecasting model.” 2016. Web. 11 Apr 2021.

Vancouver:

Narasingaraj HB. Optimizing smoothing parameters for the triple exponential forecasting model. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/90834.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Narasingaraj HB. Optimizing smoothing parameters for the triple exponential forecasting model. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/90834

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

3. Kaushik, Varsha Ravi Prakash. GPU accelerated Hungarian algorithm for traveling salesman problem.

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

URL: http://hdl.handle.net/2142/97805

► In this thesis, we present a model of the Traveling Salesman Problem (TSP) cast in a quadratic assignment problem framework with linearized objective function and…
(more)

Subjects/Keywords: Compute Unified Device Architecture (CUDA); Linear assignment problem; Traveling salesman problem; Reformulation Linearization Technique (RLT)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kaushik, V. R. P. (2017). GPU accelerated Hungarian algorithm for traveling salesman problem. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97805

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kaushik, Varsha Ravi Prakash. “GPU accelerated Hungarian algorithm for traveling salesman problem.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/97805.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kaushik, Varsha Ravi Prakash. “GPU accelerated Hungarian algorithm for traveling salesman problem.” 2017. Web. 11 Apr 2021.

Vancouver:

Kaushik VRP. GPU accelerated Hungarian algorithm for traveling salesman problem. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/97805.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kaushik VRP. GPU accelerated Hungarian algorithm for traveling salesman problem. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97805

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

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

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

URL: http://hdl.handle.net/2142/108439

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} 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 (7^{th} 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

5. Kwon, Hee Youn. New developments in causal inference using balance optimization subset selection.

Degree: PhD, Systems & Entrepreneurial Engr, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/100968

► Causal inference with observational data has drawn attention across various fields. These observational studies typically use matching methods which find matched pairs with similar covariate…
(more)

Subjects/Keywords: Causal Analysis; Optimization; Subset Selection

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kwon, H. Y. (2018). New developments in causal inference using balance optimization subset selection. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100968

Chicago Manual of Style (16^{th} Edition):

Kwon, Hee Youn. “New developments in causal inference using balance optimization subset selection.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/100968.

MLA Handbook (7^{th} Edition):

Kwon, Hee Youn. “New developments in causal inference using balance optimization subset selection.” 2018. Web. 11 Apr 2021.

Vancouver:

Kwon HY. New developments in causal inference using balance optimization subset selection. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/100968.

Council of Science Editors:

Kwon HY. New developments in causal inference using balance optimization subset selection. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100968

University of Illinois – Urbana-Champaign

6. Salimi, Ehsan. On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets.

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

URL: http://hdl.handle.net/2142/88056

► A set of n-dimensional integral vectors, Nn, is said to be right-closed if for any x 2 , any vector y x also belongs to…
(more)

Subjects/Keywords: Right-closed set; convexity; integer convexity; polyhedral theory; Petri Nets; Liveness

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Salimi, E. (2015). On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88056

Chicago Manual of Style (16^{th} Edition):

Salimi, Ehsan. “On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/88056.

MLA Handbook (7^{th} Edition):

Salimi, Ehsan. “On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets.” 2015. Web. 11 Apr 2021.

Vancouver:

Salimi E. On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/88056.

Council of Science Editors:

Salimi E. On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88056

7. Ganesan, Sharathram. Mixed integer linear programming approach for solving assembly scheduling problems.

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

URL: http://hdl.handle.net/2142/99279

► In this research, the problem of scheduling operations in manufacturing facilities with multiple machines that produce complex multi-level assemblies is considered. The problem is modeled…
(more)

Subjects/Keywords: Scheduling; Mixed Integer Linear Program (MILP); CPLEX; Batch overlapping

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ganesan, S. (2017). Mixed integer linear programming approach for solving assembly scheduling problems. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/99279

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ganesan, Sharathram. “Mixed integer linear programming approach for solving assembly scheduling problems.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/99279.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ganesan, Sharathram. “Mixed integer linear programming approach for solving assembly scheduling problems.” 2017. Web. 11 Apr 2021.

Vancouver:

Ganesan S. Mixed integer linear programming approach for solving assembly scheduling problems. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/99279.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ganesan S. Mixed integer linear programming approach for solving assembly scheduling problems. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/99279

Not specified: Masters Thesis or Doctoral Dissertation

8. Date, Ketan Hemant. Theoretical and computational advances in finite-size facility placement and assignment problems.

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

URL: http://hdl.handle.net/2142/95355

► The goal of this research is to develop fundamental theory and exact solution methods for the optimal placement of multiple, finite-size, rectangular facilities in presence…
(more)

Subjects/Keywords: Facility location; Finite size facility; Dominance; High performance computing (HPC); Graphics processing units (GPU); Compute unified device architecture (CUDA); Linear Assignment Problem; Quadratic Assignment Problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Date, K. H. (2016). Theoretical and computational advances in finite-size facility placement and assignment problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95355

Chicago Manual of Style (16^{th} Edition):

Date, Ketan Hemant. “Theoretical and computational advances in finite-size facility placement and assignment problems.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 11, 2021. http://hdl.handle.net/2142/95355.

MLA Handbook (7^{th} Edition):

Date, Ketan Hemant. “Theoretical and computational advances in finite-size facility placement and assignment problems.” 2016. Web. 11 Apr 2021.

Vancouver:

Date KH. Theoretical and computational advances in finite-size facility placement and assignment problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/2142/95355.

Council of Science Editors:

Date KH. Theoretical and computational advances in finite-size facility placement and assignment problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95355