The following pages link to A Theorem on Boolean Matrices (Q5729523):
Displaying 50 items.
- A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
- On the optimality of Bellman-Ford-Moore shortest path algorithm (Q266282) (← links)
- Abstract derivation of transitive closure algorithms (Q287162) (← links)
- Inverse problems of demand analysis and their applications to computation of positively-homogeneous Konüs-Divisia indices and forecasting (Q318172) (← links)
- A multi-criteria police districting problem for the efficient and effective design of patrol sector (Q319842) (← links)
- A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
- On tropical fractional linear programming (Q401201) (← links)
- Crossover can provably be useful in evolutionary computation (Q418021) (← links)
- An all-pairs shortest path algorithm for bipartite graphs (Q469055) (← links)
- Quantifying the multi-scale performance of network inference algorithms (Q470320) (← links)
- The computational complexity of rationalizing Pareto optimal choice behavior (Q483106) (← links)
- Formal study of functional orbits in finite domains (Q483296) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- A note on testing axioms of revealed preference (Q495751) (← links)
- Processing time-dependent shortest path queries without pre-computed speed information on road networks (Q497898) (← links)
- Lattice flows in networks (Q522926) (← links)
- The limit behaviour of imprecise continuous-time Markov chains (Q525496) (← links)
- Thick 2D relations for document understanding (Q558037) (← links)
- On the complexity of some extended word problems defined by cancellation rules (Q578921) (← links)
- The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation (Q613114) (← links)
- Evolutionary synthesis of low-sensitivity digital filters using adjacency matrix (Q632240) (← links)
- Finding the shortest paths by node combination (Q632873) (← links)
- A job-shop problem with one additional resource type (Q640303) (← links)
- Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem (Q656681) (← links)
- Lock-free parallel dynamic programming (Q666192) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Using multiset discrimination to solve language processing problems without hashing (Q673099) (← links)
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- YinYang bipolar logic and bipolar fuzzy logic (Q704147) (← links)
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- Sorting can exponentially speed up pure dynamic programming (Q783692) (← links)
- Transitive reduction of a nilpotent Boolean matrix (Q800374) (← links)
- Computing transitive closure on systolic arrays of fixed size (Q808290) (← links)
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations (Q812624) (← links)
- Regular algebra applied to language problems (Q817577) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Graph-based decision for Gödel-Dummett logics (Q877886) (← links)
- Finite sets of data compatible with multidimensional inequality measures (Q903665) (← links)
- Automatic generation of path conditions for concurrent timed systems (Q947796) (← links)
- Polyadic dynamic logics for HPSG parsing (Q1016030) (← links)
- Extensions of the prudence principle to exploit a valued outranking relation (Q1038343) (← links)
- A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion) (Q1057068) (← links)
- A computational procedure for the asymptotic analysis of homogeneous semi-Markov processes (Q1060493) (← links)
- On negative cycles in mixed graphs (Q1071027) (← links)
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- A non-recursive algorithm for classifying the states of a finite Markov chain (Q1082271) (← links)
- Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture (Q1084875) (← links)
- Parallel and sequential computation on Boolean networks (Q1086219) (← links)
- Transitive closure and related semiring properties via eliminants (Q1089083) (← links)
