Sciweavers

1918 search results - page 133 / 384
» Discovering Cortical Algorithms
Sort
View
IRMA
2000
14 years 11 months ago
Recognizing bounds of context change in on-line learning
The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...
Helen Kaikova, Vagan Y. Terziyan, Borys Omelayenko
FLAIRS
2010
14 years 10 months ago
Using Intelligent Agents to Build Navigation Meshes
We present a novel algorithm that allows agents to discover a navigation mesh for an environment as they move through the environment. The Navigation-Mesh Automated Discovery (NMA...
D. Hunter Hale, G. Michael Youngblood, Nikhil S. K...
ASC
2008
14 years 10 months ago
Dynamic data assigning assessment clustering of streaming data
: Discovering interesting patterns or substructures in data streams is an important challenge in data mining. Clustering algorithms are very often applied to identify single substr...
Olga Georgieva, Frank Klawonn
HEURISTICS
2007
76views more  HEURISTICS 2007»
14 years 10 months ago
Metaheuristics can solve sudoku puzzles
: In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as ‘sudoku’. We see that this ...
Rhyd Lewis
ICWSM
2010
14 years 8 months ago
Coping With Noise in a Real-World Weblog Crawler and Retrieval System
In this paper we examine the effects of noise when creating a real-world weblog corpus for information retrieval. We focus on the DiffPost (Lee et al. 2008) approach to noise remo...
James Lanagan, Paul Ferguson, Neil O'Hare, Alan F....