The following pages link to (Q3885184):
Displaying 50 items.
- Generalized minimum spanning tree games (Q286691) (← links)
- Design of computer network topologies: a Vroom inspired psychoclonal algorithm (Q350389) (← links)
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- Efficient multigrid algorithms for locally constrained parallel systems (Q580927) (← links)
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
- Optimal heapsort algorithm (Q671366) (← links)
- Shortest consistent superstrings computable in polynomial time (Q673640) (← links)
- The geo-graph in practice: creating United States congressional districts from census blocks (Q683330) (← links)
- Optimization problems in multivariable fuzzy predictive control (Q707234) (← links)
- Strategies for distributed query optimization (Q751266) (← links)
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766) (← links)
- Exponential bounds for the running time of a selection algorithm (Q760796) (← links)
- A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (Q779440) (← links)
- Loop-free algorithms for traversing binary trees (Q786538) (← links)
- A general program scheme for finding bridges (Q787676) (← links)
- A simplified NP-complete satisfiability problem (Q790612) (← links)
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- An O(n log n) Manhattan path algorithm (Q795510) (← links)
- An analytical comparison of two string searching algorithms (Q800732) (← links)
- Heuristic search for Hamilton cycles in cubic graphs (Q864114) (← links)
- The weighted perfect domination problem (Q912630) (← links)
- Information retrieval based on fuzzy associations (Q919819) (← links)
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298) (← links)
- Admissible heuristic search in AND/OR graphs (Q1054163) (← links)
- A backtracking method for constructing perfect hash functions from a set of mapping functions (Q1059411) (← links)
- Clustering to minimize the maximum intercluster distance (Q1059958) (← links)
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- Representing inverses in pure network flow optimization (Q1068691) (← links)
- The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
- A dynamic programming approach to the complete set partitioning problem (Q1091142) (← links)
- The hierarchical structure of graph searches (Q1098301) (← links)
- Optimal computation of prefix sums on a binary tree of processors (Q1099947) (← links)
- On the complexity of induction of structural descriptions (Q1100927) (← links)
- A parallel approach for theorem proving in propositional logic (Q1102766) (← links)
- The general problem solving algorithm and its implementation (Q1104126) (← links)
- On a scheduling problem where a job can be executed only by a limited number of processors (Q1104235) (← links)
- A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions (Q1107978) (← links)
- Optimality tests for fixed points of the fuzzy c-means algorithm (Q1114435) (← links)
- Parallel depth first search. I: Implementation (Q1116343) (← links)
- A randomized parallel branch-and-bound algorithm (Q1118396) (← links)
- Weakly adaptive comparison searching (Q1124340) (← links)
- Testing and reconfiguration of VLSI linear arrays (Q1128669) (← links)
- On the Ferrers dimension of a digraph (Q1158180) (← links)
- P-optimal heuristics (Q1158750) (← links)
- Parallel algorithms for the single source shortest path problem (Q1162156) (← links)
- Greedy binary search trees are nearly optimal (Q1163867) (← links)
