1197 search results - page 189 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
DIS
2010
Springer
13 years 6 months ago
2010
Springer
Sequence labeling is the task of assigning a label sequence to an observation sequence. Since many methods to solve this problem depend on the specification of predictive features...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The multiplicative algorithms are well-known for nonnegative matrix and tensor factorizations. The ALS algorithm for canonical decomposition (CP) has been proved as a “workhorse...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— A major barrier preventing the wide employment of mobile networks of robots in tasks such as exploration, mapping, surveillance, and environmental monitoring is the lack of ef...
SISW
2003
IEEE
14 years 1 months ago
2003
IEEE
— Smart cards are widely known for their tamper resistance, but only contain a small amount of memory. Though very small, this memory often contains highly valuable information (...
JNW
2006
13 years 8 months ago
2006
With the standardization of IEEE 802.11, there has been an explosive growth of wireless local area networks (WLAN). Recently, this cost effective technology is being developed aggr...