Sciweavers

7930 search results - page 462 / 1586
» Greedy in Approximation Algorithms
Sort
View
TMC
2010
152views more  TMC 2010»
15 years 5 months ago
On Multihop Distances in Wireless Sensor Networks with Random Node Locations
—Location and intersensor distance estimations are important functions for the operation of wireless sensor networks, especially when protocols can benefit from the distance info...
Serdar Vural, Eylem Ekici
TROB
2011
255views more  TROB 2011»
15 years 1 months ago
Active 3D Object Localization Using a Humanoid Robot
—We study the problem of actively searching for an object in a 3D environment under the constraint of a maximum search time, using a visually guided humanoid robot with twentysix...
Alexander Andreopoulos, Stephan Hasler, Heiko Wers...
CORR
2011
Springer
204views Education» more  CORR 2011»
14 years 10 months ago
Decentralized Supply Chain Formation: A Market Protocol and Competitive Equilibrium Analysis
Supply chain formation is the process of determining the structure and terms of exchange relationships to enable a multilevel, multiagent production activity. We present a simple ...
William E. Walsh, Michael P. Wellman
ECCV
2008
Springer
16 years 5 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
209
Voted
VTC
2008
IEEE
156views Communications» more  VTC 2008»
16 years 1 months ago
Channel Asymmetry and Random Time Slot Hopping in OFDMA-TDD Cellular Networks
Abstract—This paper studies the performance of orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) cellular networks when jointly applying dynamic ...
Ellina Foutekova, Patrick Agyapong, Harald Haas