Results 151 to 160 of about 12,182 (176)

Multi-objective spatial optimization of forest fire monitoring networks: An integrated GIS-MCDM framework enhanced by improved genetic algorithms. [PDF]

PLoS One
Wang L, Feng J, Mao J, Zhang Y, An J.
europepmc   +1 more source

Subset selection based fusion for biomedical information retrieval tasks. [PDF]

BMC Bioinformatics
Sun J, Wu S, Shen X, Nugent C, Lu H.
europepmc   +1 more source

AutoXAI: a meta-learning approach for recommendation of explanation techniques. [PDF]

Sci Rep
Shawi RE, Jamel L.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Submodular Functions and Rooted Trees

Theory of Computing Systems, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yaokun Wu, Yinfeng Zhu
openaire   +1 more source

Maximizing Non-Monotone Submodular Functions

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007
Submodular maximization generalizes many important problems including Max Cut in directed and undirected graphs and hypergraphs, certain constraint satisfaction problems, and maximum facility location problems. Unlike the problem of minimizing submodular functions, the problem of maximizing submodular functions is NP-hard.
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák   +2 more
openaire   +1 more source

Submodular function minimization

Mathematical Programming, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Submodular Functions Maximization Problems

2018
This chapter focuses on maximizing a special class of functions called submodular functions under various combinatorial constraints. It deals with algorithms maximizing submodular functions subject to combinatorial constraints. The chapter discusses basic discrete algorithms for maximizing submodular functions subject to various constraints.
Niv Buchbinder, Moran Feldman
openaire   +1 more source

Decomposition of submodular functions

Combinatorica, 1983
A decomposition theory for submodular functions is described. Any such function is shown to have a unique decomposition consisting of indecomposable functions and certain highly decomposable functions, and the latter are completely characterized. Applications include decompositions of hypergraphs based on edge and vertex connectivity, the decomposition
openaire   +1 more source