4716 search results - page 535 / 944 » Tangible functional programming |
118
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
122
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
112
Voted
ICTAI
2006
IEEE
15 years 8 months ago
2006
IEEE
A new method for optimizing complex functions and systems is described that employs Learnable Evolution Model (LEM), a form of non-Darwinian evolutionary computation guided by mac...
114
Voted
IJCNN
2006
IEEE
15 years 8 months ago
2006
IEEE
— We present a simple, intuitive argument based on “invariant imbedding” in the spirit of dynamic programming to derive a stagewise second-order backpropagation (BP) algorith...
134
click to vote
CIG
2005
IEEE
15 years 8 months ago
2005
IEEE
A newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features a...