Sciweavers

5592 search results - page 344 / 1119
» On Random Betweenness Constraints
Sort
View
FOCS
1999
IEEE
15 years 11 months ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
ICRA
1994
IEEE
105views Robotics» more  ICRA 1994»
15 years 10 months ago
Harmonic Functions and Collision Probabilities
There is a close relationship between harmonic functions { which have recently been proposed for path planning { and hitting probabilities for random processes. The hitting probab...
Christopher I. Connolly
AINA
2008
IEEE
15 years 8 months ago
Monitoring Network Traffic to Detect Stepping-Stone Intrusion
Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed t...
Jianhua Yang, Byong Lee, Stephen S. H. Huang
177
Voted
AAAI
2004
15 years 8 months ago
Affective Recruitment of Distributed Heterogeneous Agents
Members of multi-robot teams may need to collaborate to accomplish a task due to differences in capabilities. This paper describes an extension of the ALLIANCE architecture that e...
Aaron Gage, Robin R. Murphy
ICML
2010
IEEE
15 years 7 months ago
Supervised Aggregation of Classifiers using Artificial Prediction Markets
Prediction markets are used in real life to predict outcomes of interest such as presidential elections. In this work we introduce a mathematical theory for Artificial Prediction ...
Nathan Lay, Adrian Barbu