Sciweavers

1550 search results - page 199 / 310
» Benchmarking for Graph Transformation
Sort
View
90
Voted
COR
2008
118views more  COR 2008»
15 years 24 days ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
103
Voted
IJMC
2006
84views more  IJMC 2006»
15 years 21 days ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
JAIR
2007
112views more  JAIR 2007»
15 years 18 days ago
Cutset Sampling for Bayesian Networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Bozhena Bidyuk, Rina Dechter
JIKM
2011
101views more  JIKM 2011»
14 years 3 months ago
Automated Generation of Personal Data Reports from Relational Databases
Abstract. This paper presents a novel approach for extracting personal data and automatically generating Personal Data Reports (PDRs) from relational databases. Such PDRs can be us...
Georgios John Fakas, Ben Cawley, Zhi Cai
ICIP
2006
IEEE
16 years 2 months ago
A New Method for Boundary-Based Shape Matching and Retrieval
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
Minh-Son Dao, Raffaele de Amicis