12194 search results - page 258 / 2439 » Numberings Optimal for Learning |
162
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
160
click to vote
TC
1998
15 years 6 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
169
click to vote
SC
1993
ACM
15 years 10 months ago
1993
ACM
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of virtual channels required and in the number of restrictions placed on the use of t...
207
click to vote
JSAC
2006
15 years 6 months ago
2006
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...
193
click to vote
JMLR
2006
15 years 6 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...