Search results

Items from 1 to 20 out of 19,104 results

chapter

A versatile signal processor and control system for AESA radar

Marek Nalecz, Rafal Rytel-Andrianik, Marek Rupniewski, Krzysztof Kulpa, more

2016 IEEE International Symposium on Phased Array Systems and Technology (PAST) > 1 - 7

2016 IEEE International Symposium on Phased Array Systems and Technology (PAST)

The paper presents a concept of a versatile signal processor designed for a modern, active electronically scanned array (AESA) radar. The flexibility of the design is high enough to support most advanced modes of operation, including multiple-input multiple-output (MIMO) modes and cognitive radar control, reacting in real time to changing air situations. The required signal processing power calculations...

article

The exact complexity of the infinite Post Correspondence Problem

Olivier Finkel, O. Finkel

Information Processing Letters > 2015 > 115 > 6-8 > 609-611

In this short note, we give the exact complexity of the infinite Post Correspondence Problem, showing that it is Π ₁ ⁰ -complete. Surprisingly, it turns out that the infinite Post Correspondence Problem is not ''more complex'' than the Post Correspondence Problem, which is known to be Σ ₁ ⁰ -complete, but has the exact dual complexity. This gives an answer to a question of...

article

Cooperation through social influence

Xavier Molinero, Fabián Riquelme, Maria Serna, X. Molinero, more

European Journal of Operational Research > 2015 > 242 > 3 > 960-974

We consider a simple and altruistic multiagent system in which the agents are eager to perform a collective task but where their real engagement depends on the willingness to perform the task of other influential agents. We model this scenario by an influence game, a cooperative simple game in which a team (or coalition) of players succeeds if it is able to convince enough agents to participate in...

article

A limitation of cell division in tissue P systems by PSPACE

Petr Sosík, Luděk Cienciala, P. Sosik, L. Cienciala

Journal of Computer and System Sciences > 2015 > 81 > 2 > 473-484

P systems are abstract distributed computing models inspired by the information flows in living cells and their networks, with applications, e.g., in systems biology and optimization. A tissue P system is a variant based on the interchange of objects between cells due to an underlying communication graph. The model is further enriched with the operation of cell division. This operation allows to produce...

article

Backdoors to tractable answer set programming

Johannes Klaus Fichte, Stefan Szeider, J.K. Fichte, S. Szeider

Artificial Intelligence > 2015 > 220 > Complete > 64-103

Answer Set Programming (ASP) is an increasingly popular framework for declarative programming that admits the description of problems by means of rules and constraints that form a disjunctive logic program. In particular, many AI problems such as reasoning in a nonmonotonic setting can be directly formulated in ASP. Although the main problems of ASP are of high computational complexity, complete for...

article

Combinatorial optimization problems with uncertain costs and the OWA criterion

Adam Kasperski, Paweł Zieliński, A. Kasperski, P. Zielinski

Theoretical Computer Science > 2015 > 565 > Complete > 102-112

In this paper a class of combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing K distinct cost scenarios. The Ordered Weighted Averaging (OWA for short) aggregation operator is applied to choose a solution. Some well known criteria used in decision making under uncertainty such as the maximum, minimum, average,...

article

Most frugal explanations in Bayesian networks

Johan Kwisthout, J. Kwisthout

Artificial Intelligence > 2015 > 218 > Complete > 56-73

Inferring the most probable explanation to a set of variables, given a partial observation of the remaining variables, is one of the canonical computational problems in Bayesian networks, with widespread applications in AI and beyond. This problem, known as MAP, is computationally intractable (NP-hard) and remains so even when only an approximate solution is sought. We propose a heuristic formulation...

article

Holographic algorithms on bases of rank 2

Zhiguo Fu, Fengqin Yang, Z. Fu, F. Yang

Information Processing Letters > 2014 > 114 > 11 > 585-590

An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized under a suitable basis transformation (SRP). For holographic algorithms with matchgates on domain size 2, [1,2,4,5] have built a systematical theory. In this paper, we reduce SRP on domain size k>=3 to SRP on domain size 2 for holographic algorithms with matchgates on bases...

article

On influence, stable behavior, and the most influential individuals in networks: A game-theoretic approach

Mohammad T. Irfan, Luis E. Ortiz, M.T. Irfan, L.E. Ortiz

Artificial Intelligence > 2014 > 215 > Complete > 79-119

We introduce a new approach to the study of influence in strategic settings where the action of an individual depends on that of others in a network-structured way. We propose network influence games as a game-theoretic model of the behavior of a large but finite networked population. In particular, we study an instance we call linear-influence games that allows both positive and negative influence...

chapter

Towards a PML-based MLFMA for planar microwave circuits

D. Vande Ginste, E. Michielssen, F. Olyslager, D. De Zutter, more

IEEE Antennas and Propagation Society Symposium, 2004. > 2 > 1191 - 1194 Vol.2

IEEE Antennas and Propagation Society Symposium

A formalism for modeling electromagnetic propagation on, and scattering from. planar microwave structures is presented. The new technique uses the perfectly matched layer (PML) paradigm to construct an efficient multilevel fast multipole algorithm (MLFMA) for evaluating fields generated by electric current sources residing in a layered background medium. Depending on the nature of the microstrip metallization,...

article

Integrality in the multinetwork min‐cost equal‐flow problem

Refael Hassin, Renata Poznanski

Networks > 80 > 3 > 267 - 273

We consider the min‐cost flow problem on multiple networks defined on duplicates of the same directed graph. The problem is to compute feasible flows such that the sum of flow costs is minimized subject to network demands and coupling constraints that force identical flows on duplicate copies of the same edge for a subset of “special” edges. We focus on whether such a problem has an integer optimal...

article

Graph convolutional networks with higher‐order pooling for semisupervised node classification

Fangyuan Lei, Xun Liu, Jianjian Jiang, Liping Liao, more

Concurrency and Computation: Practice and Experience > 34 > 16 > n/a - n/a

The information propagation mechanism in graph‐structured networks such as social networks is the foundation of network security. The graph convolutional network (GCN) is a powerful approach for semisupervised node classification on graph‐structure data. The vertex features which pass through the graph network are affected by the k‐hop neighborhood vertices. However, current high‐order GCN approaches...

article

New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts

Logan A. Smith, Illya V. Hicks

Networks > 79 > 2 > 202 - 219

To monitor electrical activity throughout the power grid and mitigate outages, sensors known as phasor measurement units can installed. Due to implementation costs, it is desirable to minimize the number of sensors deployed while ensuring that the grid can be effectively monitored. This optimization problem motivates the graph theoretic power dominating set problem. In this paper, we propose a method...

article

Proof Compression and NP Versus PSPACE II: Addendum

Lew Gordeev, Edward Hermann Haeusler

Bulletin of the Section of Logic > 2022 > 51 > 2 > 197-205

In our previous work we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier’s cut-free sequent calculus for minimal logic (HSC) with the horizontal compressing in the corresponding minimal Prawitz-style natural deduction (ND). In this Addendum we show how to prove a weaker result NP = coNP without referring to HSC. The underlying idea (due to the second author)...

article

MIMO broadcast scheduling using binary spider monkey optimization algorithm

Jyoti Mohanty, Prabina Pattanayak, Arnab Nandi, Krishna Lal Baishnab, more

International Journal of Communication Systems > 34 > 17 > n/a - n/a

Multi‐user multiple‐input multiple‐output (MU‐MIMO) system has the capability of delivering optimal system capacity that provides the simultaneous service to a large number of users using dirty paper coding (DPC) scheme. However, the DPC scheme is quite difficult to be implemented in the real‐time scenario as the computational complexity is very high and the process cannot be accomplished within the...

article

Parallel coordinate order for high‐dimensional data

Shaima Tilouche, Vahid Partovi Nia, Samuel Bassetto

Statistical Analysis and Data Mining: The ASA Data Science Journal > 14 > 5 > 501 - 515

Visualization of high‐dimensional data is counter‐intuitive using conventional graphs. Parallel coordinates are proposed as an alternative to explore multivariate data more effectively. However, it is difficult to extract relevant information through the parallel coordinates when the data are high‐dimensional with thousands of overlapping lines. The order of the axes determines the perception of information...

article

Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks

Martine Labbé, Fränk Plein, Martin Schmidt, Johannes Thürauf

Networks > 78 > 2 > 128 - 152

We show that the feasibility of a booking in the European entry‐exit gas market can be decided in polynomial time on single‐cycle networks that are passive, i.e., do not contain controllable elements. The feasibility of a booking can be characterized by solving polynomially many nonlinear potential‐based flow models for computing so‐called potential‐difference maximizing load flow scenarios. We thus...

article

Self-Verifying Pushdown and Queue Automata

Henning Fernau, Martin Kutrib, Matthias Wendlandt

Fundamenta Informaticae > 2021 > Vol. 180, nr 1-2 > 1--28

We study the computational and descriptional complexity of self-verifying pushdown automata (SVPDA) and self-verifying realtime queue automata (SVRQA). A self-verifying automaton is a nondeterministic device whose nondeterminism is symmetric in the following sense. Each computation path can give one of the answers yes, no, or do not know. For every input word, at least one computation path must give...

article

Certain investigations on recent advances in the design of decoding algorithms using low‐density parity‐check codes and its applications

Michaelraj Kingston Roberts, Saru Kumari, Parthibaraj Anguraj

International Journal of Communication Systems > 34 > 8 > n/a - n/a

Information theory coding is an impressive and most celebrated field of research that has spawned numerous extremely important solutions to the intractable problems of secure data communications. Recent advancements in error control coding methods have seen a huge surge in using low‐density parity‐check (LDPC) code‐based decoding algorithms to solve imperative issues related to reliable data transmission...

article

The firebreak problem

Kathleen D. Barnetson, Andrea C. Burgess, Jessica Enright, Jared Howell, more

Networks > 77 > 3 > 372 - 382

Suppose we have a network that is represented by a graph G. Potentially a fire (or other type of contagion) might erupt at some vertex of G. We are able to respond to this outbreak by establishing a firebreak at k other vertices of G, so that the fire cannot pass through these fortified vertices. The question that now arises is which k vertices will result in the greatest number of vertices being...

Publication date

Last year (3)
Last 3 years (23)

Close

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

From:

To:
Set your own date range

Content availability

Available (18,205)
None (899)

Publication type

book (12,911)
article (6,193)

Publication language

English (19,092)
Polish (10)
French (1)
Spanish (1)

Keywords

COMPUTATIONAL COMPLEXITY (19,104)
COMPLEXITY THEORY (2,743)
ALGORITHM DESIGN AND ANALYSIS (1,987)
DATA MINING (1,387)
OPTIMISATION (1,064)
COMPUTATIONAL MODELING (1,025)
OPTIMIZATION (976)
DECODING (969)
ENCODING (937)
VIDEO CODING (932)
POLYNOMIALS (795)
OFDM MODULATION (777)
TIME COMPLEXITY (702)
SIGNAL TO NOISE RATIO (696)
MIMO COMMUNICATION (694)
APPROXIMATION ALGORITHMS (682)
SCHEDULING (680)
GRAPH THEORY (661)
MIMO (653)
OFDM (637)
MATHEMATICAL MODEL (601)
SEARCH PROBLEMS (596)
HEURISTIC ALGORITHMS (589)
ESTIMATION (588)
SIGNAL PROCESSING ALGORITHMS (587)
NP-HARD PROBLEM (586)
EQUATIONS (576)
APPROXIMATION METHODS (575)
FEATURE EXTRACTION (558)
BIT ERROR RATE (547)
MATRIX ALGEBRA (547)
PIXEL (514)
CONVERGENCE (507)
ITERATIVE METHODS (502)
GENETIC ALGORITHMS (497)
CHANNEL ESTIMATION (486)
ERROR STATISTICS (481)
MOTION ESTIMATION (468)
RECEIVERS (448)
CORRELATION (444)
ACCURACY (440)
VECTORS (438)
RESOURCE MANAGEMENT (435)
PROBABILITY (429)
WIRELESS SENSOR NETWORKS (429)
DATA COMPRESSION (420)
INTERFERENCE (415)
NOISE (407)
IMAGE CODING (396)
TRAINING (391)
DELAY (376)
LEAST MEAN SQUARES METHODS (373)
LEARNING (ARTIFICIAL INTELLIGENCE) (371)
APPROXIMATION THEORY (362)
COMPUTATION COMPLEXITY (362)
TREES (MATHEMATICS) (359)
ROBUSTNESS (352)
PROBABILITY DENSITY FUNCTION (349)
HARDWARE (340)
INTERPOLATION (339)
CLUSTERING ALGORITHMS (336)
SIGNAL PROCESSING (335)
DETECTORS (334)
RESOURCE ALLOCATION (334)
INTERFERENCE SUPPRESSION (333)
CRYPTOGRAPHY (332)
TRANSFORMS (329)
INDEXES (325)
NP-COMPLETE PROBLEM (322)
WIRELESS COMMUNICATION (322)
MAXIMUM LIKELIHOOD ESTIMATION (321)
QUALITY OF SERVICE (315)
COMMUNICATION COMPLEXITY (314)
IMAGE SEGMENTATION (306)
TRANSMITTING ANTENNAS (306)
ARRAY SIGNAL PROCESSING (305)
ARTIFICIAL NEURAL NETWORKS (303)
ROUTING (296)
ADAPTIVE FILTERS (295)
COMPUTER ARCHITECTURE (294)
MATRIX DECOMPOSITION (293)
FILTERING THEORY (290)
GENETIC ALGORITHM (288)
PREDICTION ALGORITHMS (288)
KERNEL (286)
LINEAR PROGRAMMING (284)
PROCESSOR SCHEDULING (282)
PROTOCOLS (276)
RECEIVING ANTENNAS (274)
WIRELESS CHANNELS (272)
PATTERN CLUSTERING (265)
CLASSIFICATION ALGORITHMS (264)
THROUGHPUT (264)
ARRAYS (263)
ITERATIVE DECODING (263)
ANTENNA ARRAYS (262)
FADING CHANNELS (261)
EIGENVALUES AND EIGENFUNCTIONS (256)
CHANNEL CODING (253)
PARALLEL ALGORITHMS (251)
more

Data set

ieee (16,471)
Elsevier (1,651)
Springer (793)
BazTech (104)
Wiley (68)
DML (12)
PSJD (3)
CEJSH (2)

INFONA - science communication portal

Search results

A versatile signal processor and control system for AESA radar

The exact complexity of the infinite Post Correspondence Problem

Cooperation through social influence

A limitation of cell division in tissue P systems by PSPACE

Backdoors to tractable answer set programming

Combinatorial optimization problems with uncertain costs and the OWA criterion

Most frugal explanations in Bayesian networks

Holographic algorithms on bases of rank 2

On influence, stable behavior, and the most influential individuals in networks: A game-theoretic approach

Towards a PML-based MLFMA for planar microwave circuits

Integrality in the multinetwork min‐cost equal‐flow problem

Graph convolutional networks with higher‐order pooling for semisupervised node classification

New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts

Proof Compression and NP Versus PSPACE II: Addendum

MIMO broadcast scheduling using binary spider monkey optimization algorithm

Parallel coordinate order for high‐dimensional data

Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks

Self-Verifying Pushdown and Queue Automata

Certain investigations on recent advances in the design of decoding algorithms using low‐density parity‐check codes and its applications

The firebreak problem

Filter options

Publication date

Content availability

Publication type

Publication language

Keywords

Data set

INFONA - science communication portal

Search results

Add recipient

Sending message cancelled

Are you sure you want to cancel sending this message?

Send message

Filter options

Publication date

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

Content availability

Publication type

Publication language

Keywords

Data set

Reporting an error / abuse

Sending the report failed

Accessibility options