• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 127 matches

• 2022
• 
  Gaël Aglin:
  Optimal decision trees under constraints. Catholic University of Louvain, Louvain-la-Neuve, Belgium, 2022
• 
  Mounir Atiq:
  Elderly monitoring using decision trees under domain shifts and computational resource constraints. (Monitoring de personnes âgées basé sur des modèles d'arbres de décision en conditions de variation de domaines et de ressources computationnelles limitées). University of Paris-Saclay, France, 2022
• 
  Piotr Wojciechowski, K. Subramani:
  On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems. Ann. Math. Artif. Intell. 90(10): 979-998 (2022)
• 
  Bernard Fortz, Luis Gouveia, Pedro Moura:
  A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints. Networks 80(2): 178-192 (2022)
• 
  Biing-Feng Wang:
  Efficient algorithms for the minmax regret path center problem with length constraint on trees. Theor. Comput. Sci. 918: 18-31 (2022)
• 
  Alexander Thebelt, Calvin Tsay, Robert M. Lee, Nathan Sudermann-Merx, David Walz, Behrang Shafei, Ruth Misener:
  Tree ensemble kernels for Bayesian optimization with known constraints over mixed-feature spaces. NeurIPS 2022
• 
  Alexander Thebelt, Calvin Tsay, Robert M. Lee, Nathan Sudermann-Merx, David Walz, Behrang Shafei, Ruth Misener:
  Tree ensemble kernels for Bayesian optimization with known constraints over mixed-feature spaces. CoRR abs/2207.00879 (2022)
• 2021
• 
  Patrick Landwehr:
  Tree automata with constraints on infinite trees. RWTH Aachen University, Germany, 2021
• 
  Foto N. Afrati, Matthew Damigos:
  Querying Collections of Tree-Structured Records in the Presence of Within-Record Referential Constraints. DEXA (1) 2021: 285-291
• 
  Foto N. Afrati, Matthew Damigos:
  Querying collections of tree-structured records in the presence of within-record referential constraints. CoRR abs/2102.06563 (2021)
• 2020
• 
  Jaime E. González, André Augusto Ciré, Andrea Lodi, Louis-Martin Rousseau:
  Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem. Constraints An Int. J. 25(1-2): 23-46 (2020)
• 
  Kien Trung Nguyen, Nguyen Thanh Hung, Huong Nguyen-Thu:
  A linear time algorithm for the p-maxian problem on trees with distance constraint. J. Comb. Optim. 40(4): 1030-1043 (2020)
• 
  Samuel C. Gutekunst, David P. Williamson:
  Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP. Oper. Res. Lett. 48(3): 245-248 (2020)
• 2019
• 
  Sabine Bauer:
  Decidability of linear tree constraints for resource analysis of object-oriented programs. Ludwig Maximilian University of Munich, Germany, 2019
• 
  Marlene Pinzi, Stefano Galvan, Ferdinando Rodriguez y Baena:
  The Adaptive Hermite Fractal Tree (AHFT): a novel surgical 3D path planning approach with curvature and heading constraints. Int. J. Comput. Assist. Radiol. Surg. 14(4): 659-670 (2019)
• 
  Tianyu Wang, Odile Bellenguez-Morineau:
  A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time. J. Sched. 22(6): 709-714 (2019)
• 
  Adalat Jabrayilov, Petra Mutzel:
  A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. ALENEX 2019: 107-116
• 
  Samuel C. Gutekunst, David P. Williamson:
  Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP. CoRR abs/1907.11669 (2019)
• 
  Benjamin Bumpus, Patrick Prosser, James Trimble:
  A Constraint Model for the Tree Decomposition of a Graph. CoRR abs/1908.02530 (2019)
• 2018
• 
  Jérémy Guillot:
  Résolution exacte de problèmes de couverture par arborescences sous contraintes de capacité. (Exact methods for solving covering problems with trees subject to capacity constraints). University of Bordeaux, France, 2018
• 
  Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
  A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem. J. Heuristics 24(3): 359-394 (2018)
• 
  Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys:
  Reasoning about integrity constraints for tree-structured data. Theory Comput. Syst. 62(4): 941-976 (2018)
• 
  Tansel Dökeroglu, Erhan Mengusoglu:
  A self-adaptive and stagnation-aware breakout local search algorithm on the grid for the Steiner tree problem with revenue, budget and hop constraints. Soft Comput. 22(12): 4133-4151 (2018)
• 
  Philippe Jégou, Hélène Kanso, Cyril Terrioux:
  On the Relevance of Optimal Tree Decompositions for Constraint Networks. ICTAI 2018: 738-743
• 
  Adalat Jabrayilov, Petra Mutzel:
  A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. CoRR abs/1806.10697 (2018)
• 2017
• 
  Vladimir A. Bondarenko, Andrei V. Nikolaev, Dzhambolet Shovgenov:
  1-Skeletons of the Spanning Tree Problems with Additional Constraints. Autom. Control. Comput. Sci. 51(7): 682-688 (2017)
• 
  Luis Gouveia, Luidi Simonetti:
  Spanning trees with a constraint on the number of leaves. A new formulation. Comput. Oper. Res. 81: 257-268 (2017)
• 
  Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
  The emptiness problem for tree automata with at least one global disequality constraint is NP-hard. Inf. Process. Lett. 118: 6-9 (2017)
• 
  Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
  Satisfiability of ECTL∗ with Local Tree Constraints. Theory Comput. Syst. 61(2): 689-720 (2017)
• 
  Yinfei Xu, Jun Chen, Qiao Wang:
  The Sum Rate of Vector Gaussian Multiple Description Coding With Tree-Structured Covariance Distortion Constraints. IEEE Trans. Inf. Theory 63(10): 6547-6560 (2017)

skipping 97 more matches