Sciweavers

2159 search results - page 330 / 432
» An Artificial Chemistry for Networking
Sort
View
CP
2003
Springer
15 years 11 months ago
Improved Algorithms for Max-restricted Path Consistency
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Fabrizio Grandoni, Giuseppe F. Italiano
ECAL
2003
Springer
15 years 11 months ago
Pattern Recognition in a Bucket
This paper demonstrates that the waves produced on the surface of water can be used as the medium for a “Liquid State Machine” that pre-processes inputs so allowing a simple pe...
Chrisantha Fernando, Sampsa Sojakka
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 11 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
ANNPR
2006
Springer
15 years 10 months ago
Simple and Effective Connectionist Nonparametric Estimation of Probability Density Functions
Abstract. Estimation of probability density functions (pdf) is one major topic in pattern recognition. Parametric techniques rely on an arbitrary assumption on the form of the unde...
Edmondo Trentin
EWCBR
2006
Springer
15 years 10 months ago
Fast Case Retrieval Nets for Textual Data
Case Retrieval Networks (CRNs) facilitate flexible and efficient retrieval in Case-Based Reasoning (CBR) systems. While CRNs scale up well to handle large numbers of cases in the c...
Sutanu Chakraborti, Robert Lothian, Nirmalie Wirat...