Sciweavers

2814 search results - page 397 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
14 years 1 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
GFKL
2006
Springer
78views Data Mining» more  GFKL 2006»
14 years 1 months ago
Putting Successor Variety Stemming to Work
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
Benno Stein, Martin Potthast
IJIT
2004
13 years 11 months ago
On the Noise Distance in Robust Fuzzy C-Means
In the last decades, a number of robust fuzzy clustering algorithms have been proposed to partition data sets affected by noise and outliers. Robust fuzzy C-means (robust-FCM) is c...
Mario G. C. A. Cimino, Graziano Frosini, Beatrice ...
JSAC
2006
128views more  JSAC 2006»
13 years 10 months ago
A framework for misuse detection in ad hoc networks- part II
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
D. Subhadrabandhu, S. Sarkar, F. Anjum
AI
2000
Springer
13 years 10 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...