Showing 1 - 10 of 12
A sensor with two active phrases means that active mode has two phases, the full-active phase and the semi-active phase, which require different energy consumptions. A full-active sensor can sense data packets, transmit, receive, and relay the data packets. A semi-active sensor cannot sense data...
Persistent link: https://www.econbiz.de/10010994107
In this paper we consider two branch and bound algorithms for the maximum clique problem which demonstrate the best performance on DIMACS instances among the existing methods. These algorithms are MCS algorithm by Tomita et al. (<CitationRef CitationID="CR31">2010</CitationRef>) and MAXSAT algorithm by Li and Quan (<CitationRef CitationID="CR21">2010a</CitationRef>, <CitationRef CitationID="CR22">b</CitationRef>). We suggest a...</citationref></citationref></citationref>
Persistent link: https://www.econbiz.de/10010994124
Several numerical methods for solving nonlinear systems of equations assume that derivative information is available. Furthermore, these approaches usually do not consider the problem of finding all solutions to a nonlinear system. Rather, most methods output a single solution. In this paper, we...
Persistent link: https://www.econbiz.de/10010937780
Persistent link: https://www.econbiz.de/10010845799
Persistent link: https://www.econbiz.de/10008673926
Persistent link: https://www.econbiz.de/10008673944
The earliest approaches to the cell formation problem in group technology, dealing with a binary machine-part incidence matrix, were aimed only at minimizing the number of intercell moves (exceptional elements in the block-diagonalized matrix). Later on this goal was extended to simultaneous...
Persistent link: https://www.econbiz.de/10011151230
Graph coloring is an important tool in the study of optimization, computer science, network design, e.g., file transferring in a computer network, pattern matching, computation of Hessians matrix and so on. In this paper, we consider one important coloring, vertex coloring of a total graph,...
Persistent link: https://www.econbiz.de/10011151241
The inverse max + sum spanning tree (IMSST) problem is studied, which is the first inverse problem on optimization problems with combined minmax–minsum objective functions. Given an edge-weighted undirected network <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$G(V,E,c,w)$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mrow> <mi>G</mi> <mo stretchy="false">(</mo> <mi>V</mi> <mo>,</mo> <mi>E</mi> <mo>,</mo> <mi>c</mi> <mo>,</mo> <mi>w</mi> <mo stretchy="false">)</mo> </mrow> </math> </EquationSource> </InlineEquation>, the MSST problem is to find a...</equationsource></equationsource></inlineequation>
Persistent link: https://www.econbiz.de/10011151246
Persistent link: https://www.econbiz.de/10010896382