loading
Solving the Square Path Problem up to 20 × 20
2006 Edition, September 1, 2006 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Given an mtimesn rectangular lattice, the square path problem is to find the minimum number f(m, n) of lattice points whose deletion removes all square paths from the lattice. It is known that f(n, n) is asymptotically equal to...

A New Minimum Exposure Path Problem and Its Solving Algorithm
2015 Edition, December 1, 2015 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The original minimum exposure path (MEP) problem in wireless sensor networks (WSN) does not take into account the actual constraint conditions of the path. This paper proposes a new MEP problem which requires the path must lie along...

A general constrained shortest path approach for virtual path embedding
2016 Edition, June 1, 2016 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Network virtualization has become a fundamental technology to deliver services for emerging data-intensive applications in fields such as bioinformatics and retail analytics hosted at multi-data center scale. To create and maintain a successful virtual network service, the...

AIRP: A heuristic algorithm for solving the unrelated parallel machine scheduling problem
2014 Edition, July 1, 2014 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

This paper deals with the Unrelated Parallel Machine Scheduling Problem with Setup Times (UPMSPST). The objective is to minimize the makespan. In order to solve it, we propose a heuristic algorithm, based on Iterated Local Search (ILS), Variable...

Solving traveling salesman problem by real space renormalization technique
1994 Edition, Volume 7, January 1, 1994 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

A real space renormalization technique is introduced which is used in the study of critical phenomenon, to obtain approximate solutions of traveling salesman problems. In the procedure the author prepares in advance the basic optimized paths for...

Solving Linear Diophantine Systems on Parallel Architectures
Volume PP - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Solving linear Diophantine systems of equations is applied in discrete-event systems, model checking, formal languages and automata, logic programming, cryptography, networking, signal processing, and chemistry. For modeling discrete systems with Petri nets, a solution in non-negative...

Solving the Secondary Structure Matching Problem in Cryo-EM De Novo Modeling Using a Constrained $K$ -Shortest Path Graph Algorithm
2014 Edition, Volume 11, March 1, 2014 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Electron cryomicroscopy is becoming a major experimental technique in solving the structures of large molecular assemblies. More and more three-dimensional images have been obtained at the medium resolutions between 5 and 10 Å. At this resolution range, major α-helices can be...

Least Square Approach to Multi-Path Maxmin Rate Allocation
2006 Edition, Volume 1, September 1, 2006 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The maxmin fair bandwidth allocation has been proposed as a flow control mechanism for managing the data traffic in connection-oriented networks. This paper devises a fast convergence algorithm based on the least square approach to solve multi-level...

Dynamic allocation of resources to virtual path agents
2004 Edition, Volume 12, August 1, 2004 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

One of the major problems faced in operating large networks is the enormous amount of processing and communications overhead required for setting up and tearing down the large number of connections maintained by the network. ATM and MPLS aim at...

From Square Pieces to Brick Walls: The Next Challenge in Solving Jigsaw Puzzles
2017 Edition, October 1, 2017 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Research into computational jigsaw puzzle solving, an emerging theoretical problem with numerous applications, has focused in recent years on puzzles that constitute square pieces only. In this paper we wish to extend the scientific scope of appearance-based...

Advertisement