Sciweavers

2939 search results - page 213 / 588
» A geometric approach to aggregation
Sort
View
136
Voted
SEMCO
2007
IEEE
15 years 8 months ago
Sub-Symbolic Semantic Layer in Cyc for Intuitive Chat-Bots
The work presented in this paper aims to combine Latent Semantic Analysis methodology, common sense and traditional knowledge representation in order to improve the dialogue capab...
Giovanni Pilato, Agnese Augello, Giorgio Vassallo,...
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 8 months ago
A novel generative encoding for exploiting neural network sensor and output geometry
A significant problem for evolving artificial neural networks is that the physical arrangement of sensors and effectors is invisible to the evolutionary algorithm. For example,...
David B. D'Ambrosio, Kenneth O. Stanley
ICA
2007
Springer
15 years 8 months ago
On Separation of Signal Sources Using Kernel Estimates of Probability Densities
The discussion in this paper revolves around the notion of separation problems. The latter can be thought of as a unifying concept which includes a variety of important problems in...
Oleg V. Michailovich, Douglas Wiens
103
Voted
ISPAN
2005
IEEE
15 years 7 months ago
QoS-Energy aware Broadcast for Sensor Networks
We present QoS Geometric Broadcast Protocol (QoSGBP), a novel broadcasting protocol for heterogeneous wireless ad hoc and sensor networks. While broadcasting is a very energy-expe...
Arjan Durresi, Vamsi Paruchuri, Leonard Barolli
138
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar