1806 search results - page 19 / 362 » Some Functions Computable with a Fused-Mac |
153
Voted
GECCO
2011
Springer
14 years 4 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
102
Voted
AAAI
2010
15 years 2 months ago
2010
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
126
Voted
FLOPS
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
120
click to vote
TC
2008
15 years 15 days ago
2008
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
122
Voted
CORR
2004
Springer
15 years 13 days ago
2004
Springer
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...