Sciweavers

1331 search results - page 126 / 267
» Complexity bounds for zero-test algorithms
Sort
View
IVC
2007
102views more  IVC 2007»
13 years 10 months ago
Analysis of the rubberband algorithm
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
ANCS
2007
ACM
14 years 2 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 3 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
CN
2006
82views more  CN 2006»
13 years 10 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
COR
2006
122views more  COR 2006»
13 years 10 months ago
Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
Tal Shima, Steven J. Rasmussen, Andrew G. Sparks, ...