Results 211 to 220 of about 33,631 (264)
Real-world evaluat ion of hybrid Green AI for sustainable and efficient smart supply chain distribution. [PDF]
Sci RepHassouna MA +3 more
europepmc +1 more source
TGN-MCDS: A Temporal Graph Network-Based Algorithm for Cluster-Head Optimization in Large-Scale FANETs. [PDF]
Sensors (Basel)Fan X, Yang Y, Zhang S, Cai W.
europepmc +1 more source
An equity aware recommender system for university admissions balancing operational constraints and strategic objectives. [PDF]
Sci RepIbrahim A, Alarood A, Alsolami E.
europepmc +1 more source
A set cover algorithm identifies minimal circulating tumour DNA sequencing targets for colorectal cancer detection. [PDF]
Sci RepMoloney-Geany K +4 more
europepmc +1 more source
The Ground-Set-Cost Budgeted Maximum Coverage Problem. [PDF]
Theory Comput Systvan Heuven van Staereling I +2 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of VLSI signal processing systems for signal, image and video technology, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
AlRustamani, Amina +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
AlRustamani, Amina +2 more
openaire +1 more source
Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '92, 1992
The greedy paradigm of algorithm design is a well known tool used for efficiently solving many classical computational problems within the framework of procedural languages. However, it is very difficult to express these algorithms within the declarative framework of logic-based languages.
GRECO, Sergio, Ganguly S, Zaniolo C.
openaire +2 more sources
The greedy paradigm of algorithm design is a well known tool used for efficiently solving many classical computational problems within the framework of procedural languages. However, it is very difficult to express these algorithms within the declarative framework of logic-based languages.
GRECO, Sergio, Ganguly S, Zaniolo C.
openaire +2 more sources
Proceedings of the nineteenth design automation conference on - DAC '82, 1982
Abstract A ‘greedy’ channel-router is presented. It is quick, simple and effective. It always suceeds, usually using no more than one track more than required by channel density. It may be forced in rare cases to make a few connections ‘off the end’ of the channel, in order to succeed.
Ronald L. Rivest, Charles M. Fiduccia
openaire +1 more source
Abstract A ‘greedy’ channel-router is presented. It is quick, simple and effective. It always suceeds, usually using no more than one track more than required by channel density. It may be forced in rare cases to make a few connections ‘off the end’ of the channel, in order to succeed.
Ronald L. Rivest, Charles M. Fiduccia
openaire +1 more source
Journal of Algorithms, 1996
Summary: We study decision problems of the following form: Given an instance of a combinatorial problem, can it be solved by a greedy algorithm? We present algorithms for the recognition of greedy instances of certain problems, structural characterization of such instances for other problems, and proofs of NP-hardness of the recognition problem for ...
Caro, Yair +2 more
openaire +2 more sources
Summary: We study decision problems of the following form: Given an instance of a combinatorial problem, can it be solved by a greedy algorithm? We present algorithms for the recognition of greedy instances of certain problems, structural characterization of such instances for other problems, and proofs of NP-hardness of the recognition problem for ...
Caro, Yair +2 more
openaire +2 more sources