4926 search results - page 225 / 986 » Two Graph Algorithms On an Associative Computing Model |
186
click to vote
ICCS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show tha...
153
click to vote
FCCM
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper describes a powerful, scalable, reconfigurable computer called the PARTS engine. The PARTS engine consists of 16 Xilinx 4025 FPGAs, and 16 one-megabyte SRAMs. The FPGAs...
171
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
177
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: The Generalized Hidden Markov Model (GHMM) has proven a useful framework for the task of computational gene prediction in eukaryotic genomes, due to its flexibility an...
193
click to vote
DAIS
2011
14 years 10 months ago
2011
Abstract. Dealing with Network Address Translators (NATs) is a central problem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay n...