16093 search results - page 2794 / 3219 » On the optimality of the neighbor-joining algorithm |
193
click to vote
ICSM
1994
IEEE
15 years 11 months ago
1994
IEEE
Although data pow analysis was first developed for use in compilers, its usefulness is now recognized in many software tools. Because of its compiler origins, the computation of d...
212
click to vote
COCO
1994
Springer
15 years 11 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
205
click to vote
PLDI
1994
ACM
15 years 11 months ago
1994
ACM
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
171
click to vote
ICALP
1992
Springer
15 years 11 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
194
click to vote
KR
1992
Springer
15 years 11 months ago
1992
Springer
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...