Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/14590
Nаziv: | Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems | Аutоri: | Stojmenović, I. Miyakawa, M. |
Dаtum izdаvаnjа: | 1-јан-1988 | Čаsоpis: | Computer Journal | Sažetak: | On the basis of a backtrack procedure for lexicographic enumeration of all subsets of a set of n elements, we give an algorithm for both determining all bases consisting of functions from a given complete set in a considered subset of the set of k-valued logical functions, and for enumeration of all classes of bases in the subset. We use the lexicographic algorithm also for solving knapsack and minimal covering problems. A cut technique is described which is used in these algorithms to reduce the number of examined subsets of left brace 1,. . . , n right brace . | URI: | https://open.uns.ac.rs/handle/123456789/14590 | ISSN: | 00104620 | DOI: | 10.1093/comjnl/31.1.65 |
Nаlаzi sе u kоlеkciјаmа: | Naučne i umetničke publikacije |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
13
prоvеrеnо 20.11.2023.
Prеglеd/i stаnicа
12
Prоtеklа nеdеljа
9
9
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.