Sciweavers

575 search results - page 99 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
EMO
2006
Springer
219views Optimization» more  EMO 2006»
13 years 11 months ago
ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization
Abstract. This paper presents ParadisEO-MOEO, a white-box objectoriented generic framework dedicated to the flexible design of evolutionary multi-objective algorithms. This paradig...
Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourd...
ASAP
2000
IEEE
102views Hardware» more  ASAP 2000»
13 years 11 months ago
A Theory for Software-Hardware Co-Scheduling for ASIPs and Embedded Processors
Exploiting instruction-level parallelism (ILP) is extremely important for achieving high performance in application specific instruction set processors (ASIPs) and embedded proces...
Ramaswamy Govindarajan, Erik R. Altman, Guang R. G...
ACL
2008
13 years 9 months ago
Pivot Approach for Extracting Paraphrase Patterns from Bilingual Corpora
Paraphrase patterns are useful in paraphrase recognition and generation. In this paper, we present a pivot approach for extracting paraphrase patterns from bilingual parallel corp...
Shiqi Zhao, Haifeng Wang, Ting Liu, Sheng Li
DC
2010
13 years 7 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
TCOM
2008
151views more  TCOM 2008»
13 years 7 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee