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:"Brown University" +contributor:("Mathieu, Claire"). Showing records 1 – 7 of 7 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Eisenstat, David Elliot. Toward Practical Planar Graph Algorithms.

Degree: PhD, Computer Science, 2014, Brown University

 Many optimization problems involving graphs naturally feature road networks, grids, or other large planar graphs. By exploiting the special structure of planar graphs, it is… (more)

Subjects/Keywords: planar

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Eisenstat, D. E. (2014). Toward Practical Planar Graph Algorithms. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:386247/

Chicago Manual of Style (16th Edition):

Eisenstat, David Elliot. “Toward Practical Planar Graph Algorithms.” 2014. Doctoral Dissertation, Brown University. Accessed September 22, 2019. https://repository.library.brown.edu/studio/item/bdr:386247/.

MLA Handbook (7th Edition):

Eisenstat, David Elliot. “Toward Practical Planar Graph Algorithms.” 2014. Web. 22 Sep 2019.

Vancouver:

Eisenstat DE. Toward Practical Planar Graph Algorithms. [Internet] [Doctoral dissertation]. Brown University; 2014. [cited 2019 Sep 22]. Available from: https://repository.library.brown.edu/studio/item/bdr:386247/.

Council of Science Editors:

Eisenstat DE. Toward Practical Planar Graph Algorithms. [Doctoral Dissertation]. Brown University; 2014. Available from: https://repository.library.brown.edu/studio/item/bdr:386247/

2. Mercier, Luc H. Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization.

Degree: PhD, Computer Science, 2009, Brown University

 Online stochastic combinatorial optimization problems are problems in which a decision maker is trying to minimize or maximize an objective by making a sequence of… (more)

Subjects/Keywords: stochastic optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mercier, L. H. (2009). Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:95/

Chicago Manual of Style (16th Edition):

Mercier, Luc H. “Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization.” 2009. Doctoral Dissertation, Brown University. Accessed September 22, 2019. https://repository.library.brown.edu/studio/item/bdr:95/.

MLA Handbook (7th Edition):

Mercier, Luc H. “Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization.” 2009. Web. 22 Sep 2019.

Vancouver:

Mercier LH. Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization. [Internet] [Doctoral dissertation]. Brown University; 2009. [cited 2019 Sep 22]. Available from: https://repository.library.brown.edu/studio/item/bdr:95/.

Council of Science Editors:

Mercier LH. Amsaa: An Anticipatory Algorithm for Online Stochastic Combinatorial Optimization. [Doctoral Dissertation]. Brown University; 2009. Available from: https://repository.library.brown.edu/studio/item/bdr:95/

3. Yip, Yue Kwen Justin. The Length-Lex Representation for Constraint Programming over Sets.

Degree: PhD, Computer Science, 2011, Brown University

 Constraint Programming is a declarative programming paradigm for solving hard combinatorial problems. Its model consists of a set of decision variables, and a set of… (more)

Subjects/Keywords: Constraint Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yip, Y. K. J. (2011). The Length-Lex Representation for Constraint Programming over Sets. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:11342/

Chicago Manual of Style (16th Edition):

Yip, Yue Kwen Justin. “The Length-Lex Representation for Constraint Programming over Sets.” 2011. Doctoral Dissertation, Brown University. Accessed September 22, 2019. https://repository.library.brown.edu/studio/item/bdr:11342/.

MLA Handbook (7th Edition):

Yip, Yue Kwen Justin. “The Length-Lex Representation for Constraint Programming over Sets.” 2011. Web. 22 Sep 2019.

Vancouver:

Yip YKJ. The Length-Lex Representation for Constraint Programming over Sets. [Internet] [Doctoral dissertation]. Brown University; 2011. [cited 2019 Sep 22]. Available from: https://repository.library.brown.edu/studio/item/bdr:11342/.

Council of Science Editors:

Yip YKJ. The Length-Lex Representation for Constraint Programming over Sets. [Doctoral Dissertation]. Brown University; 2011. Available from: https://repository.library.brown.edu/studio/item/bdr:11342/

4. Das, Aparna. Approximation Schemes for Euclidean Vehicle Routing Problems.

Degree: PhD, Computer Science, 2011, Brown University

 Vehicle routing is a class of optimization problems where the objective is to find low cost delivery routes from depots to customers using vehicles of… (more)

Subjects/Keywords: Geometric Approximation Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Das, A. (2011). Approximation Schemes for Euclidean Vehicle Routing Problems. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:11205/

Chicago Manual of Style (16th Edition):

Das, Aparna. “Approximation Schemes for Euclidean Vehicle Routing Problems.” 2011. Doctoral Dissertation, Brown University. Accessed September 22, 2019. https://repository.library.brown.edu/studio/item/bdr:11205/.

MLA Handbook (7th Edition):

Das, Aparna. “Approximation Schemes for Euclidean Vehicle Routing Problems.” 2011. Web. 22 Sep 2019.

Vancouver:

Das A. Approximation Schemes for Euclidean Vehicle Routing Problems. [Internet] [Doctoral dissertation]. Brown University; 2011. [cited 2019 Sep 22]. Available from: https://repository.library.brown.edu/studio/item/bdr:11205/.

Council of Science Editors:

Das A. Approximation Schemes for Euclidean Vehicle Routing Problems. [Doctoral Dissertation]. Brown University; 2011. Available from: https://repository.library.brown.edu/studio/item/bdr:11205/

5. Schudy, Warren J. Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data.

Degree: PhD, Computer Science, 2012, Brown University

 In correlation clustering, given similarity or dissimilarity information for all pairs of data items, the goal is to find a clustering of the items into… (more)

Subjects/Keywords: dense constraint satisfaction problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schudy, W. J. (2012). Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:297610/

Chicago Manual of Style (16th Edition):

Schudy, Warren J. “Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data.” 2012. Doctoral Dissertation, Brown University. Accessed September 22, 2019. https://repository.library.brown.edu/studio/item/bdr:297610/.

MLA Handbook (7th Edition):

Schudy, Warren J. “Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data.” 2012. Web. 22 Sep 2019.

Vancouver:

Schudy WJ. Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data. [Internet] [Doctoral dissertation]. Brown University; 2012. [cited 2019 Sep 22]. Available from: https://repository.library.brown.edu/studio/item/bdr:297610/.

Council of Science Editors:

Schudy WJ. Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data. [Doctoral Dissertation]. Brown University; 2012. Available from: https://repository.library.brown.edu/studio/item/bdr:297610/

6. Mozes, Shay. Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.

Degree: PhD, Computer Science, 2013, Brown University

 Large graphs are ubiquitous in many diverse fields ranging from sociology and economics to biology and engineering. Applications in numerous areas such as transportation, geographical… (more)

Subjects/Keywords: planar graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mozes, S. (2013). Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:320482/

Chicago Manual of Style (16th Edition):

Mozes, Shay. “Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.” 2013. Doctoral Dissertation, Brown University. Accessed September 22, 2019. https://repository.library.brown.edu/studio/item/bdr:320482/.

MLA Handbook (7th Edition):

Mozes, Shay. “Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs.” 2013. Web. 22 Sep 2019.

Vancouver:

Mozes S. Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. [Internet] [Doctoral dissertation]. Brown University; 2013. [cited 2019 Sep 22]. Available from: https://repository.library.brown.edu/studio/item/bdr:320482/.

Council of Science Editors:

Mozes S. Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. [Doctoral Dissertation]. Brown University; 2013. Available from: https://repository.library.brown.edu/studio/item/bdr:320482/

7. Coffrin, Carleton James. Decision Support for Disaster Management Through Hybrid Optimization.

Degree: PhD, Computer Science, 2012, Brown University

 Recent natural disasters, such as Hurricane Katrina in 2005 and the Japan earthquake in 2011, have demonstrated that situational awareness, the focus of much research… (more)

Subjects/Keywords: Disaster Management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Coffrin, C. J. (2012). Decision Support for Disaster Management Through Hybrid Optimization. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:297611/

Chicago Manual of Style (16th Edition):

Coffrin, Carleton James. “Decision Support for Disaster Management Through Hybrid Optimization.” 2012. Doctoral Dissertation, Brown University. Accessed September 22, 2019. https://repository.library.brown.edu/studio/item/bdr:297611/.

MLA Handbook (7th Edition):

Coffrin, Carleton James. “Decision Support for Disaster Management Through Hybrid Optimization.” 2012. Web. 22 Sep 2019.

Vancouver:

Coffrin CJ. Decision Support for Disaster Management Through Hybrid Optimization. [Internet] [Doctoral dissertation]. Brown University; 2012. [cited 2019 Sep 22]. Available from: https://repository.library.brown.edu/studio/item/bdr:297611/.

Council of Science Editors:

Coffrin CJ. Decision Support for Disaster Management Through Hybrid Optimization. [Doctoral Dissertation]. Brown University; 2012. Available from: https://repository.library.brown.edu/studio/item/bdr:297611/

.