Sciweavers

12825 search results - page 15 / 2565
» Improved PLSOM algorithm
Sort
View
AICCSA
2007
IEEE
110views Hardware» more  AICCSA 2007»
14 years 3 months ago
Benchmarking XML-Schema Matching Algorithms for Improving Automated Tuning
Several matching algorithms were recently developed in order to automate or semi-automate the process of correspondences discovery between XML schemas. These algorithms use a wide...
Mohamed Boukhebouze, Rami Rifaieh, Aïcha-Nabi...
IWPEC
2009
Springer
14 years 3 months ago
Improved Parameterized Algorithms for the Kemeny Aggregation Problem
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
Narges Simjour
ISCAS
2005
IEEE
107views Hardware» more  ISCAS 2005»
14 years 2 months ago
Parameter domain pruning for improving convergence of synthesis algorithms
— This paper presents a parameter domain pruning method. Parameter domain pruning aims to identify parameter sub-domains that are more likely to produce feasible and good design ...
Hua Tang, Alex Doboli
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
14 years 2 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield
HIPC
2009
Springer
13 years 6 months ago
Improved opportunistic scheduling algorithms for WiMAX Mobile Multihop Relay networks
We investigate the problem of scheduling in OFDMbased multihop relay networks with special emphasis on IEEE 802.16j based WiMAX networks. In such networks, scheduling is the probl...
Srinath Narasimha, Krishna M. Sivalingam