Results 231 to 240 of about 305,625 (281)
Predicting FOX gene candidates for oxic nitrogen fixation using multi-omic machine learning and comparative bioinformatics. [PDF]
Sci RepYoung J, Gu L, Zhou R.
europepmc +1 more source
A Flash Group Creation Algorithm for P300 Brain-Computer Interface Integration with Irregular Assistive Technology Keyboard Layouts. [PDF]
Sensors (Basel)Huggins JE +3 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
Acta Numerica, 2006
In this survey we discuss properties of specific methods of approximation that belong to a family of greedy approximation methods (greedy algorithms). It is now well understood that we need to study nonlinear sparse representations in order to significantly increase our ability to process (compress, denoise,etc.) large data sets. Sparse representations
openaire +1 more source
In this survey we discuss properties of specific methods of approximation that belong to a family of greedy approximation methods (greedy algorithms). It is now well understood that we need to study nonlinear sparse representations in order to significantly increase our ability to process (compress, denoise,etc.) large data sets. Sparse representations
openaire +1 more source
SIAM Journal on Computing, 1991
Summary: Scheduling packets to be forwarded over a link is an important subtask of the routing process in both parallel computing and in communication networks. This paper investigates the simple class of greedy scheduling algorithms, namely, algorithm that always forward a packet if they can.
Cidon, Israel +3 more
openaire +2 more sources
Summary: Scheduling packets to be forwarded over a link is an important subtask of the routing process in both parallel computing and in communication networks. This paper investigates the simple class of greedy scheduling algorithms, namely, algorithm that always forward a packet if they can.
Cidon, Israel +3 more
openaire +2 more sources
Mathematical Notes, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources