Sciweavers

4377 search results - page 708 / 876
» Mass problems and randomness
Sort
View
INFOSCALE
2006
ACM
16 years 1 months ago
A generic search strategy for large-scale real-world networks
— We consider the following situation for a given large-scale network: Starting from an initial node we move to its neighbor node and repeat that until reaching a target node. Ho...
Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kuni...
ISLPED
2006
ACM
106views Hardware» more  ISLPED 2006»
16 years 1 months ago
Maximizing the lifetime of embedded systems powered by fuel cell-battery hybrids
—Fuel cell (FC) is a viable alternative power source for portable applications; it has higher energy density than traditional Li-ion battery and thus can achieve longer lifetime ...
Jianli Zhuo, Chaitali Chakrabarti, Naehyuck Chang,...
PEWASUN
2006
ACM
16 years 1 months ago
Revisiting neighbor discovery with interferences consideration
In wireless multi-hop networks, hello protocols for neighbor discovery are a basic service offered by the networking stack. However, their study usually rely on rather simplistic...
Elyes Ben Hamida, Guillaume Chelius, Eric Fleury
SAC
2006
ACM
16 years 1 months ago
Efficient query routing for information retrieval in semantic overlays
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically...
Hai Jin, Xiaoming Ning, Hanhua Chen, Zuoning Yin
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
16 years 1 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert