Sciweavers

2842 search results - page 361 / 569
» Expansion and Search in Networks
Sort
View
MOBIHOC
2010
ACM
15 years 4 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
16 years 7 months ago
Scalable and near real-time burst detection from eCommerce queries
In large scale online systems like Search, eCommerce, or social network applications, user queries represent an important dimension of activities that can be used to study the imp...
Nish Parikh, Neel Sundaresan
ICRA
2009
IEEE
132views Robotics» more  ICRA 2009»
16 years 1 months ago
Smoothed Sarsa: Reinforcement learning for robot delivery tasks
— Our goal in this work is to make high level decisions for mobile robots. In particular, given a queue of prioritized object delivery tasks, we wish to find a sequence of actio...
Deepak Ramachandran, Rakesh Gupta
169
Voted
COSIT
2009
Springer
159views GIS» more  COSIT 2009»
16 years 1 months ago
Adaptable Path Planning in Regionalized Environments
Human path planning relies on several more aspects than only geometric distance between two locations. These additional aspects mostly relate to the complexity of the traveled path...
Kai-Florian Richter
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
16 years 1 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl