Sciweavers

2814 search results - page 76 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ATAL
2005
Springer
13 years 12 months ago
Tactical coordination in no-press diplomacy
While there is a broad theoretic foundation for creating computational players for two-player games, such as Chess, the multi-player domain is not as well explored. We make an att...
Stefan J. Johansson, Fredrik Håård
BMCBI
2008
108views more  BMCBI 2008»
13 years 10 months ago
An analysis of the positional distribution of DNA motifs in promoter regions and its biological relevance
Background: Motif finding algorithms have developed in their ability to use computationally efficient methods to detect patterns in biological sequences. However the posterior cla...
Ana C. Casimiro, Susana Vinga, Ana T. Freitas, Arl...
GLOBECOM
2008
IEEE
14 years 4 months ago
Distributed Spectrum Allocation of Delay-Sensitive Users over Multi-User Multi-Carrier Networks
—In this paper, we study the distributed spectrum allocation for autonomous users transmitting delay-sensitive information over a wireless multi-carrier network. Because there is...
Wenchi Tu, Mihaela van der Schaar
PODC
2003
ACM
14 years 3 months ago
Adapting to a reliable network path
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
Baruch Awerbuch, Yishay Mansour
SIGPRO
2008
151views more  SIGPRO 2008»
13 years 10 months ago
An adaptive penalized maximum likelihood algorithm
The LMS algorithm is one of the most popular learning algorithms for identifying an unknown system. Many variants of the algorithm have been developed based on different problem f...
Guang Deng, Wai-Yin Ng