1749 search results - page 300 / 350 » Conditional colorings of graphs |
126
click to vote
SAS
2004
Springer
15 years 10 months ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
134
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
Kahn defined a formal model for networks of processes that communicate through channels carrying streams of data tokens. His mathematical results show the necessary conditions fo...
131
click to vote
FUN
2010
Springer
15 years 9 months ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
170
click to vote
GI
1997
Springer
15 years 8 months ago
1997
Springer
This paper gives an overview of an architecture and search organization for large vocabulary, continuous speech recognition (LVCSR at RWTH). In the rst part of the paper, we descri...
147
click to vote
PLILP
1997
Springer
15 years 8 months ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...