Sciweavers

1822 search results - page 71 / 365
» The Method of Assigning Incidences
Sort
View
CEEMAS
2007
Springer
14 years 4 months ago
Collaborative Attack Detection in High-Speed Networks
We present a multi-agent system designed to detect malicious traffic in high-speed networks. In order to match the performance requirements related to the traffic volume, the net...
Martin Rehák, Michal Pechoucek, Pavel Celed...
ICRA
2002
IEEE
94views Robotics» more  ICRA 2002»
14 years 2 months ago
Weighted Range Sensor Matching Algorithms for Mobile Robot Displacement Estimation
This paper introduces a “weighted” matching algorithm to estimate a robot’s planar displacement by matching twodimensional range scans. The influence of each scan point on ...
Samuel T. Pfister, Kristopher L. Kriechbaum, Sterg...
ASPDAC
1999
ACM
93views Hardware» more  ASPDAC 1999»
14 years 2 months ago
Optimization of Linear Placements for Wirelength Minimization with Free Sites
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
Andrew B. Kahng, Paul Tucker, Alexander Zelikovsky
AAAI
2008
14 years 9 days ago
Adaptive Treatment of Epilepsy via Batch-mode Reinforcement Learning
This paper highlights the crucial role that modern machine learning techniques can play in the optimization of treatment strategies for patients with chronic disorders. In particu...
Arthur Guez, Robert D. Vincent, Massimo Avoli, Joe...
IPCO
2008
118views Optimization» more  IPCO 2008»
13 years 11 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...