Sciweavers

1871 search results - page 242 / 375
» The Ephemeral Pairing Problem
Sort
View
NECO
2007
258views more  NECO 2007»
15 years 6 months ago
Reinforcement Learning Through Modulation of Spike-Timing-Dependent Synaptic Plasticity
The persistent modification of synaptic efficacy as a function of the relative timing of pre- and postsynaptic spikes is a phenomenon known as spiketiming-dependent plasticity (...
Razvan V. Florian
NLE
2010
166views more  NLE 2010»
15 years 5 months ago
Wisdom of crowds versus wisdom of linguists - measuring the semantic relatedness of words
In this article, we present a comprehensive study aimed at computing semantic relatedness of word pairs. We analyze the performance of a large number of semantic relatedness measu...
Torsten Zesch, Iryna Gurevych
TCOM
2011
130views more  TCOM 2011»
15 years 1 months ago
Indirect Reciprocity Game Modelling for Cooperation Stimulation in Cognitive Networks
—In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their...
Yan Chen, K. J. Ray Liu
WWW
2011
ACM
15 years 1 months ago
A self-training approach for resolving object coreference on the semantic web
An object on the Semantic Web is likely to be denoted with multiple URIs by different parties. Object coreference resolution is to identify “equivalent” URIs that denote the ...
Wei Hu, Jianfeng Chen, Yuzhong Qu
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
16 years 1 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi