2335 search results - page 301 / 467 » Functional Differentiation of Computer Programs |
133
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...
106
Voted
AI
2001
Springer
15 years 6 months ago
2001
Springer
A system's constraints characterizes what that system can do. However, a dynamic environment may require that a system alter its constraints. If feedback about a specific situ...
104
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We introduce a novel software-protection method, which can be fully implemented with today's technologies, that provides traitor tracing and license-enforcement functionalitie...
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 ...
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...