2694 search results - page 363 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
169
click to vote
PODC
2005
ACM
16 years 2 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
167
click to vote
GECCO
2007
Springer
16 years 20 days ago
2007
Springer
E-commerce has transformed the way firms develop their pricing strategies, producing shift away from fixed pricing to dynamic pricing. In this paper, we use two different Estim...
169
click to vote
SPAA
2005
ACM
16 years 2 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
129
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions...
178
click to vote
NOSSDAV
2009
Springer
16 years 1 months ago
2009
Springer
Data dissemination in decentralized networks is often realized by using some form of swarming technique. Swarming enables nodes to gather dynamically in order to fulfill a certai...