1952 search results - page 125 / 391 » Complete partitions of graphs |
161
click to vote
MAM
2007
15 years 4 months ago
2007
This paper describes a new method of executing a software program on an FPGA for embedded systems. Rather than combine reconfigurable logic with a microprocessor core, this method...
142
click to vote
EPEW
2005
Springer
15 years 10 months ago
2005
Springer
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
161
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...
121
click to vote
FSTTCS
2005
Springer
15 years 10 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
152
click to vote
LCTRTS
2010
Springer
15 years 11 months ago
2010
Springer
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...