4835 search results - page 559 / 967 » Refactoring Functional Programs |
181
click to vote
ICALP
2007
Springer
16 years 29 days 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 ...
167
click to vote
ICALP
2007
Springer
16 years 29 days 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...
182
click to vote
ICTAI
2006
IEEE
16 years 25 days 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...
175
click to vote
IJCNN
2006
IEEE
16 years 25 days 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...
186
click to vote
CIG
2005
IEEE
16 years 13 days 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...