8540 search results - page 1636 / 1708 » The Dynamic Servers Problem |
105
click to vote
BIBE
2008
IEEE
15 years 4 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
BIBM
2008
IEEE
15 years 4 months ago
2008
IEEE
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— We study the problem of dynamic learning by a social network of agents. Each agent receives a signal about an underlying state and communicates with a subset of agents (his nei...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we investigate the problem of designing a switching compensator for a plant switching amongst a (finite) family of given configurations (Ai,Bi,Ci). We assume that...
FGR
2008
IEEE
15 years 4 months ago
2008
IEEE
One prediction about this future of pervasive technology is that people will carry the tools needed to interface with technological resources sprinkled through out the environment...