2934 results — page 31 of 147

In this paper, we propose a new scheme for building algorithms to detect communities in networks. This new approach is based upon a vertex centrality measur...

BibTeX reference
, , , and

Extreme Learning Machine (ELM) has recently increased popularity and has been successfully applied to a wide range of applications. Variants using regulariza...

BibTeX reference
, , and

The technological developments observed in the last two decades contributed to the digitalization of products and the introduction of devices to consume th...

BibTeX reference
, , and

An electronic nose (e-nose) is a device that analyzes the chemical components of an odour. The e-nose consists of an array of gas sensors for chemical detect...

BibTeX reference
, , , , and

In this article we consider a real-world problem submitted to us by the Hatch company. This problem consists of designing a collection network for a wind f...

BibTeX reference
and

Scheduling activities in an underground mine is a very complex task. This paper presents an optimization model for short-term planning that takes into consid...

BibTeX reference
, , and

Given a graph \(G=(V,E)\) with a root \(r\in V\), positive capacities \(\{c(e) | e\in E\}\), and non-negative lengths \(\{\ell(e) | e\in E\}\), the m...

BibTeX reference

Positron emission tomography (PET) image reconstruction in the presence of periodic motion, such as heartbeat and breathing, has been actively investigated ...

BibTeX reference
, , and

Automatic programming is an efficient technique that has contributed to an important development in the artificial intelligence field. In this paper, we intr...

BibTeX reference
and

One of the most complex early-exercise decisions faced by traders in the financial derivatives markets is with T-Bond futures, due to the combination of mu...

BibTeX reference
and

Let \(\gamma(G)\) and \(\iota(G)\) be the domination and independent domination numbers of a graph \(G\), respectively. Introduced by Sumner and Moorer...

BibTeX reference

This paper presents an optimization method to solve the short-term unit commitment and loading problem with uncertain inflows. A scenario tree is built base...

BibTeX reference
, , and

In this paper, we introduce a general framework for vector space decompositions that decompose the set partitioning problem into a reduced problem, defined...

BibTeX reference
, , and

Inspired by successful biological collective decision mechanisms such as honey bees searching for a new colony or the collective navigation of fish schoo...

BibTeX reference

This paper addresses the problem of minimizing the number of moves to unload a set of boxes off a gravity conveyor by a forklift. If the input data is known ...

BibTeX reference
and

Advanced Metering Infrastructures ({AMI}s) lay the foundation of a wide variety of smart grid applications. Despite their low capacity, RF-mesh systems are a...

BibTeX reference
, , and

We consider the maximum \(k\)-cut problem that consists in partitioning the vertex set of a graph into \(k\) subsets such that the sum of the weights o...

BibTeX reference
, , and

This paper presents the results of two explorations: one, exhaustive, of the graph sets from 4 to 10 vertices, and other, using AGX-III program on graphs fro...

BibTeX reference
, , and

We consider a linear-state dynamic game played over an event tree and determine analytically the price of anarchy (PoA), as well as lower and upper bounds ...

BibTeX reference

In this paper, we show that cooperative outcomes in a dynamic game played over an event tree can be supported strategically, that is, to be part of a subga...

BibTeX reference