4131 search results - page 502 / 827 » Compactness in Topology and Computation |
165
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
185
click to vote
FPL
2006
Springer
15 years 10 months ago
2006
Springer
A Field Programmable Gate Array (FPGA), when used as a platform for implementing special-purpose computing architectures, offers the potential for increased functional parallelism...
205
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Action set selection in Markov Decision Processes (MDPs) is an area of research that has received little attention. On the other hand, the set of actions available to an MDP agent...
147
Voted
OOPSLA
1997
Springer
15 years 10 months ago
1997
Springer
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyp...
166
click to vote
VISSYM
2007
15 years 9 months ago
2007
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...