Sciweavers

3652 search results - page 351 / 731
» A study of query length
Sort
View
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Randomized Algorithms for Motif Detection
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
Lusheng Wang, Liang Dong, Hui Fan
ICPP
2003
IEEE
15 years 9 months ago
Dynamic Control Frames in Reservation-Based Packet Scheduling for Single-Hop WDM Networks
In reservation-based packet scheduling algorithms for single-hop WDM networks, one of the wavelengths is used as a control channel which is shared by all of the nodes for transmit...
Hwa-Chun Lin, Pei-Shin Liu
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 8 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
15 years 7 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
157
Voted
JSAT
2008
122views more  JSAT 2008»
15 years 3 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya