Sciweavers

2905 search results - page 117 / 581
» Formal Memetic Algorithms
Sort
View
ICML
1998
IEEE
14 years 11 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...
COLCOM
2005
IEEE
14 years 3 months ago
Scheduling algorithms for peer-to-peer collaborative file distribution
—Peer-to-Peer file sharing applications in the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discov...
Jonathan S. K. Chan, Victor O. K. Li, King-Shan Lu...
ICDCSW
2005
IEEE
14 years 3 months ago
Analysis and Algorithms for Content-Based Event Matching
    Content-based  event  matching  is  an  important  problem  in  large-scale  event-based  publish/subscribe  systems.  However,  open  questions  remain  in ...
Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pa...
DLT
2004
13 years 11 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
ATAL
2010
Springer
13 years 11 months ago
Ants meeting algorithms
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech