10493 search results - page 2025 / 2099 » Dynamic Word Problems |
SYSTOR
2009
ACM
14 years 2 months ago
2009
ACM
A typical storage hierarchy comprises of components with varying performance and cost characteristics, providing multiple options for data placement. We propose and evaluate a hie...
BIBE
2008
IEEE
14 years 2 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
14 years 2 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
14 years 2 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
14 years 2 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...