Sciweavers

321 search results - page 15 / 65
» Partitioning by iterative deletion
Sort
View
EPIA
1999
Springer
14 years 2 months ago
A New Approach to Base Revision
We present three approaches to revision of belief bases, which are also examined in the case in which the sentences in the base are partitioned between those which can and those wh...
Paolo Di Giusto, Guido Governatori
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 11 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 10 months ago
Generalized Traveling Salesman Problem Reduction Algorithms
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
Gregory Gutin, Daniel Karapetyan
CASES
2009
ACM
13 years 8 months ago
Mapping stream programs onto heterogeneous multiprocessor systems
This paper presents a partitioning and allocation algorithm for an iterative stream compiler, targeting heterogeneous multiprocessors with constrained distributed memory and any c...
Paul M. Carpenter, Alex Ramírez, Eduard Ayg...
IPPS
1997
IEEE
14 years 2 months ago
Maintaining Spatial Data Sets in Distributed-Memory Machines
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
Susanne E. Hambrusch, Ashfaq A. Khokhar