2001 search results - page 271 / 401 » Local solutions for global problems in wireless networks |
171
click to vote
NIPS
2001
15 years 7 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
158
click to vote
CSDA
2010
15 years 6 months ago
2010
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
149
Voted
EUSFLAT
2009
15 years 4 months ago
2009
Abstract-- We discuss some optimization problems for fuzzy variable functions and show two interesting results. First result is related to conditions for existence of global optima...
146
click to vote
IPL
2010
15 years 4 months ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
182
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Reactive routing protocols like Ad-hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing in Ad-Hoc Wireless Networks (DSR) which are used in Mobile and Ad-hoc Ne...