Страницы без интервики-ссылок

Ниже показано до 50 результатов в диапазоне от 61 до 110.

Просмотреть (предыдущие 50 | следующие 50) (20 | 50 | 100 | 250 | 500)

61. Citeseer/3 Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms (2014) 10.1.1.767.2351
62. Citeseer/An Algorithm of 0-1 Knapsack Problem Based on Economic Model (2013) 10.1.1.891.434
63. Citeseer/An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem 10.1.1.300.1872
64. Citeseer/An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems (2014) 10.1.1.790.8309
65. Citeseer/An Efficient Hybrid Heuristic Method For The 0-1 Exact K-Item Quadratic Knapsack Problem (2013) 10.1.1.837.6875
66. Citeseer/An Evolutionary Path Relinking Approach for the Quadratic Multiple Knapsack Problem (2015) 10.1.1.707.4961
67. Citeseer/Approximability of Adaptive Seeding under Knapsack Constraints (2015) 10.1.1.697.7778
68. Citeseer/Automatic Generation of Multi-objective ACO Algorithms for the Bi-objective Knapsack (2012) 10.1.1.651.1191
69. Citeseer/Average-Case Performance of Rollout Algorithms for Knapsack Problems (2013) 10.1.1.367.776
70. Citeseer/Bandits with Knapsacks — Dynamic procurement for crowdsourcing 10.1.1.365.1661
71. Citeseer/Bandits with knapsacks (2013) 10.1.1.744.7353
72. Citeseer/Column generation strategies and decomposition approaches to the size robust multiple knapsack problem (2015) 10.1.1.730.8463
73. Citeseer/Construction of New Classes of Knapsack Type Public Key Cryptosystem Using Uniform Secret Sequence, K(II)ΣΠPKC, Constructed Based on Maximum Length Code (2012) 10.1.1.261.2176
74. Citeseer/Convexity and solutions of stochastic Multidimensional Knapsack Problems with Probabilistic Constraints (2012) 10.1.1.258.3304
75. Citeseer/Derandomization in Game-Theoretic Probability (2014) 10.1.1.643.1318
76. Citeseer/Derandomized Graph Product Results using the Low Degree Long Code (2014) 10.1.1.760.6492
77. Citeseer/Deterministic Parameterized Algorithms for the Graph Motif Problem (2014) 10.1.1.636.3254
78. Citeseer/Matroid and Knapsack Center Problems (2013) 10.1.1.768.8386
79. Citeseer/Multi-GPU Island-Based Genetic Algorithm for Solving the Knapsack Problem (2012) 10.1.1.261.450
80. Citeseer/On Derandomizing Algorithms that Err Extremely Rarely (2014) 10.1.1.641.8427
81. Citeseer/On the Lasserre\Sum-of-Squares Hierarchy with Knapsack Covering Inequalities (2014) 10.1.1.764.6296
82. Citeseer/On the Mixing Set with a Knapsack Constraint (2014) 10.1.1.746.9893
83. Citeseer/Packing a Knapsack of Unknown Capacity (2014) 10.1.1.744.7611
84. Citeseer/Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes (2014) 10.1.1.696.5666
85. Citeseer/Stabilized Column Generation for the Temporal Knapsack Problem using Dual-Optimal Inequalities 10.1.1.736.7664
86. Citeseer/Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints (2013) 10.1.1.644.7488
87. Citeseer/The continuous knapsack set (2014) 10.1.1.642.3962
88. Citeseer/The precedence constrained knapsack problem — Separating maximally violated inequalities (2012) 10.1.1.353.1088
89. Climbing stairs
90. CoNP
91. CoRP
92. Cocalc on Fedora
93. Coq
94. Courses
95. DSPACE
96. DTIME
97. Digprime.py
98. Diplom-tunev
99. Discovering leaders from community actions (Goyal, Bonchi, Lakshmanan, 2008)
100. DocMarking/Алгоритмы
101. DocStruct
102. EXPTIME
103. En.book-advanced-algorithms.htm
104. En.contacts.htm
105. En.cs-isp-sbornik-1.htm
106. En.cs-isp-sbornik-2006-05.htm
107. En.cs-isp-sbornik-2006-12.htm
108. En.cs-isp-sborniks.htm
109. En.index.htm
110. En.isp-guidelines.htm

Просмотреть (предыдущие 50 | следующие 50) (20 | 50 | 100 | 250 | 500)