Sciweavers

11814 search results - page 2348 / 2363
» On Generalization by Neural Networks
Sort
View
COR
2008
142views more  COR 2008»
13 years 9 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
MICRO
2007
IEEE
113views Hardware» more  MICRO 2007»
13 years 9 months ago
The High Cost of a Cheap Lesson
y abstract, it is grounded in the experience of many markets. As I will illustrate, it explains much strategic behavior. Information spreads With a bit of effort, any technically s...
Shane Greenstein
NECO
2007
150views more  NECO 2007»
13 years 9 months ago
Reinforcement Learning, Spike-Time-Dependent Plasticity, and the BCM Rule
Learning agents, whether natural or artificial, must update their internal parameters in order to improve their behavior over time. In reinforcement learning, this plasticity is ...
Dorit Baras, Ron Meir
AAAI
2010
13 years 8 months ago
A Trust Model for Supply Chain Management
hey generalize these factors to the abstract concepts of ability, integrity, and benevolence. This model does not use probabilistic decision theory. Other SCM trust factors have be...
Yasaman Haghpanah, Marie desJardins
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 8 months ago
Spectrum Sharing as Spatial Congestion Games
—In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG)...
Sahand Haji Ali Ahmad, Cem Tekin, Mingyan Liu, Ric...
« Prev « First page 2348 / 2363 Last » Next »