Sciweavers

835 search results - page 41 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
JUCS
2002
131views more  JUCS 2002»
14 years 11 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
INFOCOM
2010
IEEE
14 years 9 months ago
Efficient Resource Allocation with Flexible Channel Cooperation in OFDMA Cognitive Radio Networks
Recently, a cooperative paradigm for single-channel cognitive radio networks has been advocated, where primary users can leverage secondary users to relay their traffic. However, i...
Hong Xu, Baochun Li
EVOW
2010
Springer
14 years 10 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
DAGSTUHL
1994
15 years 19 days ago
Competitive Strategies for Autonomous Systems
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
Christian Icking, Rolf Klein
APDC
1997
15 years 20 days ago
A Parallel Algorithm for Optimal Task Assignment in Distributed Systems
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
Ishfaq Ahmad, Muhammad Kafil