Sciweavers

206 search results - page 28 / 42
» A nonblocking set optimized for querying the minimum value
Sort
View
ICC
2007
IEEE
14 years 2 months ago
Optimal Distributed Multicast Routing using Network Coding
—Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network ...
Yi Cui, Yuan Xue, Klara Nahrstedt
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
13 years 11 months ago
A method for parameter calibration and relevance estimation in evolutionary algorithms
We present and evaluate a method for estimating the relevance and calibrating the values of parameters of an evolutionary algorithm. The method provides an information theoretic m...
Volker Nannen, A. E. Eiben
DAC
1997
ACM
14 years 1 days ago
Analysis and Evaluation of Address Arithmetic Capabilities in Custom DSP Architectures
—Many application-specific architectures provide indirect addressing modes with auto-increment/decrement arithmetic. Since these architectures generally do not feature an indexe...
Ashok Sudarsanam, Stan Y. Liao, Srinivas Devadas
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
14 years 9 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis
P2P
2006
IEEE
211views Communications» more  P2P 2006»
14 years 1 months ago
Comparison of Image Similarity Queries in P2P Systems
Given some of the recent advances in Distributed Hash Table (DHT) based Peer-To-Peer (P2P) systems we ask the following questions: Are there applications where unstructured querie...
Wolfgang Müller 0002, P. Oscar Boykin, Nima S...