1197 search results - page 238 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—In recent literature, network coding has emerged as a promising information theoretic approach to improve the performance of both peer-to-peer and wireless networks. It has been...
WIKIS
2005
ACM
14 years 1 months ago
2005
ACM
We have developed a new powerful group communication system qwikWeb, which is an integration of a WikiWikiWeb (wiki) and a mailing list system. Mailing lists are useful for exchan...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
The management of privacy and security in the context of data stream management systems (DSMS) remains largely an unaddressed problem to date. Unlike in traditional DBMSs where acc...
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...