Sciweavers

5314 search results - page 879 / 1063
» Hybrid Dynamic Programming
Sort
View
103
Voted
PERCOM
2003
ACM
16 years 2 months ago
Self-Routing in Pervasive Computing Environments Using Smart Messages
Smart Messages (SMs) are dynamic collections of code and data that migrate to nodes of interest in the network and execute on these nodes. A key challenge in programming pervasive...
Cristian Borcea, Chalermek Intanagonwiwat, Akhiles...
123
Voted
MOBIHOC
2006
ACM
16 years 2 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao
112
Voted
EWSN
2006
Springer
16 years 2 months ago
FlexCup: A Flexible and Efficient Code Update Mechanism for Sensor Networks
Abstract. The ability to update the program code installed on wireless sensor nodes plays an import role in the highly dynamic environments sensor networks are often deployed in. S...
Andreas Lachenmann, Daniel Minder, Kurt Rothermel,...
111
Voted
DCC
2005
IEEE
16 years 2 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
94
Voted
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
16 years 1 days ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen