Sciweavers

97 search results - page 9 / 20
» Near-Optimal Search in Continuous Domains
Sort
View
AIPS
2007
13 years 12 months ago
Concurrent Probabilistic Temporal Planning with Policy-Gradients
We present an any-time concurrent probabilistic temporal planner that includes continuous and discrete uncertainties and metric functions. Our approach is a direct policy search t...
Douglas Aberdeen, Olivier Buffet
ATAL
2009
Springer
13 years 10 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso
AINA
2009
IEEE
14 years 4 months ago
Similarity Search over DNS Query Streams for Email Worm Detection
Email worms continue to be a persistent problem, indicating that current approaches against this class of selfpropagating malicious code yield rather meagre results. Additionally,...
Nikolaos Chatzis, Nevil Brownlee
AIR
1998
103views more  AIR 1998»
13 years 9 months ago
Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis
Abstract. Genetic algorithms play a significant role, as search techniques for handling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc...
Francisco Herrera, Manuel Lozano, José L. V...
BNCOD
2008
96views Database» more  BNCOD 2008»
13 years 11 months ago
Smooth Interpolating Histograms with Error Guarantees
Abstract. Accurate selectivity estimations are essential for query optimization decisions where they are typically derived from various kinds of histograms which condense value dis...
Thomas Neumann, Sebastian Michel