Sciweavers

15033 search results - page 318 / 3007
» Complexity Theory and Algorithms
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 7 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
TEC
2002
183views more  TEC 2002»
15 years 5 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
ATAL
2009
Springer
16 years 22 days ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
DAM
2008
136views more  DAM 2008»
15 years 6 months ago
General theory of information transfer: Updated
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main con...
Rudolf Ahlswede
143
Voted
ASAP
2005
IEEE
99views Hardware» more  ASAP 2005»
15 years 11 months ago
Variable Radix Real and Complex Digit-Recurrence Division
We propose a digit-recurrence algorithm for division in real and complex number domains using a variable radix. The objective of the approach is to simplify the prescaling of the ...
Milos D. Ercegovac, Jean-Michel Muller