Sciweavers

1871 search results - page 167 / 375
» The Ephemeral Pairing Problem
Sort
View
IROS
2007
IEEE
126views Robotics» more  IROS 2007»
16 years 28 days ago
A graph theoretic approach to optimal target tracking for mobile robot teams
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...
Jason C. Derenick, John R. Spletzer, M. Ani Hsieh
ALGOSENSORS
2007
Springer
16 years 25 days ago
Assigning Sensors to Missions with Demands
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
ICDM
2005
IEEE
185views Data Mining» more  ICDM 2005»
16 years 7 days ago
Adaptive Product Normalization: Using Online Learning for Record Linkage in Comparison Shopping
The problem of record linkage focuses on determining whether two object descriptions refer to the same underlying entity. Addressing this problem effectively has many practical ap...
Mikhail Bilenko, Sugato Basu, Mehran Sahami
RTAS
2005
IEEE
16 years 7 days ago
Scalable QoS-Based Resource Allocation in Hierarchical Networked Environment
In this paper, we study the problem of allocating end-toend bandwidth to each of multiple traffic flows in a largescale network. We adopt the QoS-based Resource Allocation Model...
Sourav Ghosh, Ragunathan Rajkumar, Jeffery P. Hans...
DIALM
2004
ACM
117views Algorithms» more  DIALM 2004»
16 years 2 days ago
OVSF-CDMA code assignment in wireless ad hoc networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code consists of an infinite number of codewords with variable rates, in contrast to the conventional orthogonal fixed-spreading...
Peng-Jun Wan, Xiang-Yang Li, Ophir Frieder