The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Δ -weak character amenability of certain Banach algebras

Hamid Sadeghi — 2019

Archivum Mathematicum

In this paper we investigate Δ -weak character amenability of certain Banach algebras such as projective tensor product A ^ B and Lau product A × θ B , where A and B are two arbitrary Banach algebras and θ Δ ( B ) , the character space of B . We also investigate Δ -weak character amenability of abstract Segal algebras and module extension Banach algebras.

Metasearch information fusion using linear programming

Gholam R. AminAli EmrouznejadHamid Sadeghi — 2012

RAIRO - Operations Research - Recherche Opérationnelle

For a specific query merging the returned results from multiple search engines, in the form of a metasearch aggregation, can provide significant improvement in the quality of relevant documents. This paper suggests a minimax linear programming (LP) formulation for fusion of multiple search engines results. The paper proposes a weighting method to include the importance weights of the underlying search engines. This is a two-phase approach which in the first phase a new method for computing the importance...

Metasearch information fusion using linear programming

Gholam R. AminAli EmrouznejadHamid Sadeghi — 2012

RAIRO - Operations Research

For a specific query merging the returned results from multiple search engines, in the form of a metasearch aggregation, can provide significant improvement in the quality of relevant documents. This paper suggests a minimax linear programming (LP) formulation for fusion of multiple search engines results. The paper proposes a weighting method to include the importance weights of the underlying search engines. This is a two-phase approach which in...

Page 1

Download Results (CSV)