Sciweavers

JSC
2000
68views more  JSC 2000»
13 years 9 months ago
New Structure Theorem for Subresultants
We give a new structure theorem for subresultants precising their gap structure and derive from it a new algorithm for computing them. If d is a bound on the degrees and a bound o...
Henri Lombardi, Marie-Françoise Roy, Mohab ...
FCSC
2007
130views more  FCSC 2007»
13 years 9 months ago
An improved algorithm for finding community structure in networks with an application to IPv6 backbone network
The discovery of community structure in a large number of complex networks has attracted lots of interest in recent years. One category of algorithms for detecting community struct...
Yingxin Guo, Ke Xu
EOR
2002
125views more  EOR 2002»
13 years 9 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz
EOR
2002
85views more  EOR 2002»
13 years 9 months ago
An improved algorithm for the packing of unequal circles within a larger containing circle
This paper describes an approved algorithm for the problems of unequal circle packing
Huaiqing Wang, Wenqi Huang, Quan Zhang, Dongming X...
ENTCS
2002
207views more  ENTCS 2002»
13 years 9 months ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka
INFORMATICALT
2000
125views more  INFORMATICALT 2000»
13 years 9 months ago
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
Gintaras Palubeckis
INFORMATICALT
2000
113views more  INFORMATICALT 2000»
13 years 9 months ago
An Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
Alfonsas Misevicius
EATCS
2002
100views more  EATCS 2002»
13 years 9 months ago
Bead-Sort: A Natural Sorting Algorithm
Nature is not only a source of minerals and precious stones but is also a mine of algorithms. By observing and studying natural phenomena, computer algorithms can be extracted. In...
Joshua J. Arulanandham, Cristian Calude, Michael J...
DSS
2002
82views more  DSS 2002»
13 years 9 months ago
On the discovery of process models from their instances
A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow managemen...
San-Yih Hwang, Wan-Shiou Yang
IJCV
2000
82views more  IJCV 2000»
13 years 9 months ago
Linear Differential Algorithm for Motion Recovery: A Geometric Approach
The aim of this paper is to explore a linear geometric algorithm for recovering the three dimensional motion of a moving camera from image velocities. Generic similarities and diff...
Yi Ma, Jana Kosecka, Shankar Sastry