Sciweavers

232 search results - page 19 / 47
» Randomized Kinodynamic Planning
Sort
View
AUSAI
2010
Springer
13 years 8 months ago
Heuristic Planning with SAT: Beyond Uninformed Depth-First Search
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
Jussi Rintanen
SAC
2004
ACM
14 years 3 months ago
A comparison of randomized and evolutionary approaches for optimizing base station site selection
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
Larry Raisanen, Roger M. Whitaker, Steve Hurley
JSAC
2007
125views more  JSAC 2007»
13 years 9 months ago
Network Dimensioning under Scheduled and Random Lightpath Demands in All-Optical WDM Networks
— In WDM optical networks connection requests can be classified into three different types: Permanent Lightpath Demands (PLDs), Scheduled Lightpath Demands (SLDs), and Random Li...
Maurice Gagnaire, Mohamed Koubàa, Nicolas P...
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 8 months ago
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Emmanuel J. Candès, Yaniv Plan
DCOSS
2011
Springer
12 years 9 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt