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 subject:(submodularity). Showing records 1 – 15 of 15 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Rey, Mário Leston. Um arcabouço generalizado para empacotamento de ramificações e outras estruturas combinatórias.

Degree: PhD, Ciência da Computação, 2012, University of São Paulo

Nesta tese, estudamos um arcabouço, introduzido por Frank, que denominamos de sistemas generalizados de núcleos. Provamos teoremas sobre empacotamentos de certos objetos combinatórios neste arcabouço,… (more)

Subjects/Keywords: arborescences; arborescências; branchings; laminaridade; laminarity; ramificações; submodularidade; submodularity; supermodularidade; supermodularity.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rey, M. L. (2012). Um arcabouço generalizado para empacotamento de ramificações e outras estruturas combinatórias. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-15022013-111836/ ;

Chicago Manual of Style (16th Edition):

Rey, Mário Leston. “Um arcabouço generalizado para empacotamento de ramificações e outras estruturas combinatórias.” 2012. Doctoral Dissertation, University of São Paulo. Accessed September 23, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-15022013-111836/ ;.

MLA Handbook (7th Edition):

Rey, Mário Leston. “Um arcabouço generalizado para empacotamento de ramificações e outras estruturas combinatórias.” 2012. Web. 23 Sep 2020.

Vancouver:

Rey ML. Um arcabouço generalizado para empacotamento de ramificações e outras estruturas combinatórias. [Internet] [Doctoral dissertation]. University of São Paulo; 2012. [cited 2020 Sep 23]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-15022013-111836/ ;.

Council of Science Editors:

Rey ML. Um arcabouço generalizado para empacotamento de ramificações e outras estruturas combinatórias. [Doctoral Dissertation]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-15022013-111836/ ;


University of Washington

2. Powers, Thomas. Differentiable and Robust Optimization Algorithms.

Degree: PhD, 2019, University of Washington

 Imposing appropriate structure or constraints onto optimization problems is often the key to deriving guarantees or improving generalization of performance aspects like generalization or interpretability.… (more)

Subjects/Keywords: deep unfolding; sparsity; submodularity; Electrical engineering; Artificial intelligence; Electrical engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Powers, T. (2019). Differentiable and Robust Optimization Algorithms. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/44667

Chicago Manual of Style (16th Edition):

Powers, Thomas. “Differentiable and Robust Optimization Algorithms.” 2019. Doctoral Dissertation, University of Washington. Accessed September 23, 2020. http://hdl.handle.net/1773/44667.

MLA Handbook (7th Edition):

Powers, Thomas. “Differentiable and Robust Optimization Algorithms.” 2019. Web. 23 Sep 2020.

Vancouver:

Powers T. Differentiable and Robust Optimization Algorithms. [Internet] [Doctoral dissertation]. University of Washington; 2019. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/1773/44667.

Council of Science Editors:

Powers T. Differentiable and Robust Optimization Algorithms. [Doctoral Dissertation]. University of Washington; 2019. Available from: http://hdl.handle.net/1773/44667


University of Minnesota

3. Tseng, Kuo-Shih. Learning in Human and Robot Search: Subgoal, Submodularity, and Sparsity.

Degree: PhD, Computer Science, 2016, University of Minnesota

 Search is an essential technology for various robotic applications and it is also central to human daily activities. Searching for targets efficiently consists of NP-hard… (more)

Subjects/Keywords: Compressed sensing; Probabilistic search; Q-learning; Sparse learning; Structure learning; Submodularity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tseng, K. (2016). Learning in Human and Robot Search: Subgoal, Submodularity, and Sparsity. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/183325

Chicago Manual of Style (16th Edition):

Tseng, Kuo-Shih. “Learning in Human and Robot Search: Subgoal, Submodularity, and Sparsity.” 2016. Doctoral Dissertation, University of Minnesota. Accessed September 23, 2020. http://hdl.handle.net/11299/183325.

MLA Handbook (7th Edition):

Tseng, Kuo-Shih. “Learning in Human and Robot Search: Subgoal, Submodularity, and Sparsity.” 2016. Web. 23 Sep 2020.

Vancouver:

Tseng K. Learning in Human and Robot Search: Subgoal, Submodularity, and Sparsity. [Internet] [Doctoral dissertation]. University of Minnesota; 2016. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/11299/183325.

Council of Science Editors:

Tseng K. Learning in Human and Robot Search: Subgoal, Submodularity, and Sparsity. [Doctoral Dissertation]. University of Minnesota; 2016. Available from: http://hdl.handle.net/11299/183325


Australian National University

4. Ding, Ni. Submodularity and Its Applications in Wireless Communications .

Degree: 2017, Australian National University

 This monograph studies the submodularity in wireless communications and how to use it to enhance or improve the design of the optimization algorithms. The work… (more)

Subjects/Keywords: submodularity; lattice; L-convexity; communication for omniscience; monotone comparative statics; Dilworth truncation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ding, N. (2017). Submodularity and Its Applications in Wireless Communications . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/124067

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

Ding, Ni. “Submodularity and Its Applications in Wireless Communications .” 2017. Thesis, Australian National University. Accessed September 23, 2020. http://hdl.handle.net/1885/124067.

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

MLA Handbook (7th Edition):

Ding, Ni. “Submodularity and Its Applications in Wireless Communications .” 2017. Web. 23 Sep 2020.

Vancouver:

Ding N. Submodularity and Its Applications in Wireless Communications . [Internet] [Thesis]. Australian National University; 2017. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/1885/124067.

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

Council of Science Editors:

Ding N. Submodularity and Its Applications in Wireless Communications . [Thesis]. Australian National University; 2017. Available from: http://hdl.handle.net/1885/124067

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


University of Technology, Sydney

5. Hussein, Fairouz. Action recognition and video summarisation by submodular inference.

Degree: 2017, University of Technology, Sydney

 In the field of computer vision, action recognition and video summarisation are two important tasks that are useful for applications such as video indexing and… (more)

Subjects/Keywords: Computer vision.; Pattern recognition systems.; Video surveillance.; Structured max-margin algorithms.; Human-computer interaction.; Submodularity .

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hussein, F. (2017). Action recognition and video summarisation by submodular inference. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/102741

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

Hussein, Fairouz. “Action recognition and video summarisation by submodular inference.” 2017. Thesis, University of Technology, Sydney. Accessed September 23, 2020. http://hdl.handle.net/10453/102741.

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

MLA Handbook (7th Edition):

Hussein, Fairouz. “Action recognition and video summarisation by submodular inference.” 2017. Web. 23 Sep 2020.

Vancouver:

Hussein F. Action recognition and video summarisation by submodular inference. [Internet] [Thesis]. University of Technology, Sydney; 2017. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/10453/102741.

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

Council of Science Editors:

Hussein F. Action recognition and video summarisation by submodular inference. [Thesis]. University of Technology, Sydney; 2017. Available from: http://hdl.handle.net/10453/102741

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

6. Gotovos, Alkis. Sampling from Probabilistic Submodular Models.

Degree: 2019, ETH Zürich

 Practical problems of discrete nature are very common in machine learning; application domains include computer vision (e.g., image segmentation), sequential decision making (e.g., active learning),… (more)

Subjects/Keywords: Approximate inference; Probabilistic models; Sampling; Submodularity; info:eu-repo/classification/ddc/510; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gotovos, A. (2019). Sampling from Probabilistic Submodular Models. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/333042

Chicago Manual of Style (16th Edition):

Gotovos, Alkis. “Sampling from Probabilistic Submodular Models.” 2019. Doctoral Dissertation, ETH Zürich. Accessed September 23, 2020. http://hdl.handle.net/20.500.11850/333042.

MLA Handbook (7th Edition):

Gotovos, Alkis. “Sampling from Probabilistic Submodular Models.” 2019. Web. 23 Sep 2020.

Vancouver:

Gotovos A. Sampling from Probabilistic Submodular Models. [Internet] [Doctoral dissertation]. ETH Zürich; 2019. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/20.500.11850/333042.

Council of Science Editors:

Gotovos A. Sampling from Probabilistic Submodular Models. [Doctoral Dissertation]. ETH Zürich; 2019. Available from: http://hdl.handle.net/20.500.11850/333042


University of Southern California

7. Das, Abhimanyu. Subset selection algorithms for prediction.

Degree: PhD, Computer Science, 2011, University of Southern California

 In this dissertation, we study the subset selection problem for prediction. It deals with choosing the “best” or “most informative” k-subset from a large set… (more)

Subjects/Keywords: approximation algorithms; machine learning; regression; feature selection; sparse approximation; compressed sensing; submodularity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Das, A. (2011). Subset selection algorithms for prediction. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644551/rec/6197

Chicago Manual of Style (16th Edition):

Das, Abhimanyu. “Subset selection algorithms for prediction.” 2011. Doctoral Dissertation, University of Southern California. Accessed September 23, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644551/rec/6197.

MLA Handbook (7th Edition):

Das, Abhimanyu. “Subset selection algorithms for prediction.” 2011. Web. 23 Sep 2020.

Vancouver:

Das A. Subset selection algorithms for prediction. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2020 Sep 23]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644551/rec/6197.

Council of Science Editors:

Das A. Subset selection algorithms for prediction. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644551/rec/6197


Georgia Tech

8. Khalil, Elias B. Optimizing the Structure of Diffusion Networks: Theory and Algorithms.

Degree: MS, Computer Science, 2014, Georgia Tech

 How can we optimize the topology of a networked system to make it resilient to flus or malware, or also conducive to the spread of… (more)

Subjects/Keywords: Networks; Submodularity; Supermodularity; Optimization; Diffusion of innovations; Epidemics; Graph theory; Algorithms; Social networks; Information networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khalil, E. B. (2014). Optimizing the Structure of Diffusion Networks: Theory and Algorithms. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55481

Chicago Manual of Style (16th Edition):

Khalil, Elias B. “Optimizing the Structure of Diffusion Networks: Theory and Algorithms.” 2014. Masters Thesis, Georgia Tech. Accessed September 23, 2020. http://hdl.handle.net/1853/55481.

MLA Handbook (7th Edition):

Khalil, Elias B. “Optimizing the Structure of Diffusion Networks: Theory and Algorithms.” 2014. Web. 23 Sep 2020.

Vancouver:

Khalil EB. Optimizing the Structure of Diffusion Networks: Theory and Algorithms. [Internet] [Masters thesis]. Georgia Tech; 2014. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/1853/55481.

Council of Science Editors:

Khalil EB. Optimizing the Structure of Diffusion Networks: Theory and Algorithms. [Masters Thesis]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/55481


University of Washington

9. Libbrecht, Maxwell Wing. Understanding human genome regulation through entropic graph-based regularization and submodular optimization.

Degree: PhD, 2016, University of Washington

 I am interested in developing computational methods to improve understanding of human genome regulation. This thesis is organized around two novel machine learning methods. First,… (more)

Subjects/Keywords: Gene regulation; Genomics; Machine learning; Probabilistic models; Regularizationg; Submodularity; Artificial intelligence; Genetics; Statistics; computer science and engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Libbrecht, M. W. (2016). Understanding human genome regulation through entropic graph-based regularization and submodular optimization. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/36547

Chicago Manual of Style (16th Edition):

Libbrecht, Maxwell Wing. “Understanding human genome regulation through entropic graph-based regularization and submodular optimization.” 2016. Doctoral Dissertation, University of Washington. Accessed September 23, 2020. http://hdl.handle.net/1773/36547.

MLA Handbook (7th Edition):

Libbrecht, Maxwell Wing. “Understanding human genome regulation through entropic graph-based regularization and submodular optimization.” 2016. Web. 23 Sep 2020.

Vancouver:

Libbrecht MW. Understanding human genome regulation through entropic graph-based regularization and submodular optimization. [Internet] [Doctoral dissertation]. University of Washington; 2016. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/1773/36547.

Council of Science Editors:

Libbrecht MW. Understanding human genome regulation through entropic graph-based regularization and submodular optimization. [Doctoral Dissertation]. University of Washington; 2016. Available from: http://hdl.handle.net/1773/36547


University of Washington

10. Liu, Zhipeng. Submodular Optimization for Power System Control and Stability.

Degree: PhD, 2019, University of Washington

 Due to the increasing demand for electricity and unpredictable supplies from renewable energy, power systems are being operated close to their stability limits. Maintaining power… (more)

Subjects/Keywords: Cascading Failure; Power Systems; Small Signal Stability; Submodular Optimization; Voltage Control; Weak Submodularity; Electrical engineering; Applied mathematics; Engineering; Electrical engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Z. (2019). Submodular Optimization for Power System Control and Stability. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/43264

Chicago Manual of Style (16th Edition):

Liu, Zhipeng. “Submodular Optimization for Power System Control and Stability.” 2019. Doctoral Dissertation, University of Washington. Accessed September 23, 2020. http://hdl.handle.net/1773/43264.

MLA Handbook (7th Edition):

Liu, Zhipeng. “Submodular Optimization for Power System Control and Stability.” 2019. Web. 23 Sep 2020.

Vancouver:

Liu Z. Submodular Optimization for Power System Control and Stability. [Internet] [Doctoral dissertation]. University of Washington; 2019. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/1773/43264.

Council of Science Editors:

Liu Z. Submodular Optimization for Power System Control and Stability. [Doctoral Dissertation]. University of Washington; 2019. Available from: http://hdl.handle.net/1773/43264


University of Washington

11. Wu, Hao-Hsiang. Stochastic Combinatorial Optimization with Applications in Graph Covering.

Degree: PhD, 2019, University of Washington

 We study stochastic combinatorial optimization models and propose methods for their solution. First, we consider a risk-neutral two-stage stochastic programming model for which the objective… (more)

Subjects/Keywords: chance constraints; conditional value-at-risk; oracle; probabilistic set covering; stochastic programming; submodularity; Operations research; Industrial engineering; Industrial engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, H. (2019). Stochastic Combinatorial Optimization with Applications in Graph Covering. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/43402

Chicago Manual of Style (16th Edition):

Wu, Hao-Hsiang. “Stochastic Combinatorial Optimization with Applications in Graph Covering.” 2019. Doctoral Dissertation, University of Washington. Accessed September 23, 2020. http://hdl.handle.net/1773/43402.

MLA Handbook (7th Edition):

Wu, Hao-Hsiang. “Stochastic Combinatorial Optimization with Applications in Graph Covering.” 2019. Web. 23 Sep 2020.

Vancouver:

Wu H. Stochastic Combinatorial Optimization with Applications in Graph Covering. [Internet] [Doctoral dissertation]. University of Washington; 2019. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/1773/43402.

Council of Science Editors:

Wu H. Stochastic Combinatorial Optimization with Applications in Graph Covering. [Doctoral Dissertation]. University of Washington; 2019. Available from: http://hdl.handle.net/1773/43402


Australian National University

12. Ajanthan, Thalaiyasingam. Optimization of Markov Random Fields in Computer Vision .

Degree: 2017, Australian National University

 A large variety of computer vision tasks can be formulated using Markov Random Fields (MRF). Except in certain special cases, optimizing an MRF is intractable,… (more)

Subjects/Keywords: Graphical Models; MRF; CRF; MEMF; Flow-encoding; IRGC; Graph-cut; Max-flow; Exit-flow; Multi-label Submodularity; Optimal Message-passing; LP-relaxation; Dense-CRF; PROX-LP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ajanthan, T. (2017). Optimization of Markov Random Fields in Computer Vision . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/137281

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

Ajanthan, Thalaiyasingam. “Optimization of Markov Random Fields in Computer Vision .” 2017. Thesis, Australian National University. Accessed September 23, 2020. http://hdl.handle.net/1885/137281.

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

MLA Handbook (7th Edition):

Ajanthan, Thalaiyasingam. “Optimization of Markov Random Fields in Computer Vision .” 2017. Web. 23 Sep 2020.

Vancouver:

Ajanthan T. Optimization of Markov Random Fields in Computer Vision . [Internet] [Thesis]. Australian National University; 2017. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/1885/137281.

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

Council of Science Editors:

Ajanthan T. Optimization of Markov Random Fields in Computer Vision . [Thesis]. Australian National University; 2017. Available from: http://hdl.handle.net/1885/137281

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

13. Bojja Venkatakrishnan, Shaileshh. Algorithms for interactive, distributed and networked systems.

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

 In recent years, massive growth in internet usage has spurred the emergence of complex large-scale networking systems to serve growing user bases, bandwidth and computation… (more)

Subjects/Keywords: Network algorithms; Interactive communication; Communication complexity; Protocol compression; Scheduling; Circuit switch; Data center networks; Submodularity; Peer-to-peer; Streaming; Topology; Bitcoin; Anonymity; Distributed algorithms; Cryptocurrency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bojja Venkatakrishnan, S. (2017). Algorithms for interactive, distributed and networked systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98367

Chicago Manual of Style (16th Edition):

Bojja Venkatakrishnan, Shaileshh. “Algorithms for interactive, distributed and networked systems.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 23, 2020. http://hdl.handle.net/2142/98367.

MLA Handbook (7th Edition):

Bojja Venkatakrishnan, Shaileshh. “Algorithms for interactive, distributed and networked systems.” 2017. Web. 23 Sep 2020.

Vancouver:

Bojja Venkatakrishnan S. Algorithms for interactive, distributed and networked systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/2142/98367.

Council of Science Editors:

Bojja Venkatakrishnan S. Algorithms for interactive, distributed and networked systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98367


University of Illinois – Urbana-Champaign

14. Truong, Anh. Feasibility optimality of periodwise static priority policies for a quality of service model in wireless networks and convergence analysis for an online recommendation system.

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

 In the first part of this thesis, we consider a proposed Quality of Service (QoS) model in which a set of clients require their own… (more)

Subjects/Keywords: QoS scheduling; randomized policies; feasibility optimal; priority policies; submodularity; polymatroid; learning with experts; weighted average prediction; availability; accuracy; convergence; sleeping experts; recommendation system.; Quality of Service (QoS)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Truong, A. (2011). Feasibility optimality of periodwise static priority policies for a quality of service model in wireless networks and convergence analysis for an online recommendation system. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26347

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

Truong, Anh. “Feasibility optimality of periodwise static priority policies for a quality of service model in wireless networks and convergence analysis for an online recommendation system.” 2011. Thesis, University of Illinois – Urbana-Champaign. Accessed September 23, 2020. http://hdl.handle.net/2142/26347.

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

MLA Handbook (7th Edition):

Truong, Anh. “Feasibility optimality of periodwise static priority policies for a quality of service model in wireless networks and convergence analysis for an online recommendation system.” 2011. Web. 23 Sep 2020.

Vancouver:

Truong A. Feasibility optimality of periodwise static priority policies for a quality of service model in wireless networks and convergence analysis for an online recommendation system. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/2142/26347.

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

Council of Science Editors:

Truong A. Feasibility optimality of periodwise static priority policies for a quality of service model in wireless networks and convergence analysis for an online recommendation system. [Thesis]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26347

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


University of Oxford

15. Zivny, Stanislav. The complexity and expressive power of valued constraints.

Degree: PhD, 2009, University of Oxford

 This thesis is a detailed examination of the expressive power of valued constraints and related complexity questions. The valued constraint satisfaction problem (VCSP) is a… (more)

Subjects/Keywords: 519; Computer science (mathematics); Discrete mathematics (statistics); Applications and algorithms; complexity; expressive power; min-cut; pseudo-Boolean optimisation; submodularity; valued constraints

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zivny, S. (2009). The complexity and expressive power of valued constraints. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:63facf22-7c2b-4d4a-8b6f-f7c323759ca0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510411

Chicago Manual of Style (16th Edition):

Zivny, Stanislav. “The complexity and expressive power of valued constraints.” 2009. Doctoral Dissertation, University of Oxford. Accessed September 23, 2020. http://ora.ox.ac.uk/objects/uuid:63facf22-7c2b-4d4a-8b6f-f7c323759ca0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510411.

MLA Handbook (7th Edition):

Zivny, Stanislav. “The complexity and expressive power of valued constraints.” 2009. Web. 23 Sep 2020.

Vancouver:

Zivny S. The complexity and expressive power of valued constraints. [Internet] [Doctoral dissertation]. University of Oxford; 2009. [cited 2020 Sep 23]. Available from: http://ora.ox.ac.uk/objects/uuid:63facf22-7c2b-4d4a-8b6f-f7c323759ca0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510411.

Council of Science Editors:

Zivny S. The complexity and expressive power of valued constraints. [Doctoral Dissertation]. University of Oxford; 2009. Available from: http://ora.ox.ac.uk/objects/uuid:63facf22-7c2b-4d4a-8b6f-f7c323759ca0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510411

.