The following pages link to Paul Helman (Q381552):
Displaying 11 items.
- A hybrid cooperative search algorithm for constrained optimization (Q381553) (← links)
- The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
- A family of NP-complete data aggregation problems (Q1103386) (← links)
- Designing deductive databases (Q1104781) (← links)
- The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
- Protecting Data Privacy Through Hard-to-Reverse Negative Databases (Q3506880) (← links)
- A Comprehensive Model of Dynamic Programming (Q3678966) (← links)
- A common schema for dynamic programming and branch and bound algorithms (Q3832081) (← links)
- A Mass Production Technique to Speed Multiple-Query Optimization and Physical Database Design (Q4025895) (← links)
- A decomposition scheme for the analysis of fault trees and other combinatorial circuits (Q4206546) (← links)
- An Exact Characterization of Greedy Structures (Q4695388) (← links)
