Sciweavers

2899 search results - page 249 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
CEC
2005
IEEE
16 years 9 days ago
Relationships between internal and external metrics in co-evolution
Co-evolutionary algorithms (CEAs) have been applied to optimization and machine learning problems with often mediocre results. One of the causes for the unfulfilled expectations i...
Elena Popovici, Kenneth A. De Jong
DEXAW
2008
IEEE
119views Database» more  DEXAW 2008»
16 years 1 months ago
Evolutionary Approaches to Linear Ordering Problem
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
Václav Snásel, Pavel Krömer, Ja...
DAM
2007
105views more  DAM 2007»
15 years 6 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
16 years 7 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
MOBIHOC
2008
ACM
16 years 6 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li