Results 1  10
of
2,721,741
The SimpleScalar tool set, version 2.0
 Computer Architecture News
, 1997
"... This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and highperformance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces, bette ..."
Abstract

Cited by 1846 (43 self)
 Add to MetaCart
This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and highperformance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces
Simple Sets Are Not BttCuppable
, 1997
"... We extend Post's result that a simple set cannot be bttcomplete by showing that in fact it cannot be bttcuppable, i.e. if the join of a c.e. set and a simple set is bttcomplete, then the nonsimple set is bttcomplete itself. The proof also yields that simple sets are not dcuppable (i.e. no ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We extend Post's result that a simple set cannot be bttcomplete by showing that in fact it cannot be bttcuppable, i.e. if the join of a c.e. set and a simple set is bttcomplete, then the nonsimple set is bttcomplete itself. The proof also yields that simple sets are not dcuppable (i
Simple Sets and Strong Reducibilities
"... We study connections between strong reducibilities and properties of computably enumerable sets such as simplicity. We call a class S of computably enumerable sets bounded iff there is an min complete computably enumerable set A such that every set in S is mreducible to A. For example, we show ..."
Abstract
 Add to MetaCart
that the class of eectively simple sets is bounded; but the class of maximal sets is not. Furthermore, the class of computably enumerable sets Turing reducible to a computably enumerable set B is bounded iff B is low 2 . For r = bwtt, tt, wtt and T , there is a bounded class intersecting every computably
Evaluating Future Microprocessors: the SimpleScalar Tool Set
, 1996
"... This document describes the SimpleScalar tool set, a collection of publiclyavailable simulation tools that use detailed execution driven to simulate modern processor architectures. In this report, we give an overview of the tool set, show how to obtain, install and use it. We also discuss detail ..."
Abstract

Cited by 475 (15 self)
 Add to MetaCart
This document describes the SimpleScalar tool set, a collection of publiclyavailable simulation tools that use detailed execution driven to simulate modern processor architectures. In this report, we give an overview of the tool set, show how to obtain, install and use it. We also discuss
THE DENSE SIMPLE SETS ARE ORBIT COMPLETE WITH RESPECT TO THE SIMPLE SETS
"... Abstract. We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets. 1. ..."
Abstract
 Add to MetaCart
Abstract. We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets. 1.
A Simple RuleBased Part of Speech Tagger
, 1992
"... Automatic part of speech tagging is an area of natural language processing where statistical techniques have been more successful than rule based methods. In this paper, we present a sim ple rulebased part of speech tagger which automatically acquires its rules and tags with accuracy coinparable ..."
Abstract

Cited by 596 (9 self)
 Add to MetaCart
for researchers to further explore rulebased tagging, searching for a better and more expressive set of rule templates and other variations on the simple but effective theme described below.
Effectively and noneffectively nowhere simple sets
 Mathematical Logic Quarterly 42
, 1996
"... Abstract. R. Shore proved that every recursively enumerable (r.e.) set can be split into two (disjoint) nowhere simple sets. Splitting theorems play an important role in recursion theory since they provide information about the lattice E of all r.e. sets. Nowhere simple sets were further studied by ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. R. Shore proved that every recursively enumerable (r.e.) set can be split into two (disjoint) nowhere simple sets. Splitting theorems play an important role in recursion theory since they provide information about the lattice E of all r.e. sets. Nowhere simple sets were further studied
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract

Cited by 2176 (27 self)
 Add to MetaCart
The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements
Dummynet: A Simple Approach to the Evaluation of Network Protocols
 ACM Computer Communication Review
, 1997
"... Network protocols are usually tested in operational networks or in simulated environments. With the former approach it is not easy to set and control the various operational parameters such as bandwidth, delays, queue sizes. Simulators are easier to control, but they are often only an approximate mo ..."
Abstract

Cited by 485 (6 self)
 Add to MetaCart
model of the desired setting, especially for what regards the various traffic generators (both producers and consumers) and their interaction with the protocol itself. In this paper we show how a simple, yet flexible and accurate network simulator  dummynet  can be built with minimal modifications
Statistical Comparisons of Classifiers over Multiple Data Sets
, 2006
"... While methods for comparing two learning algorithms on a single data set have been scrutinized for quite some time already, the issue of statistical tests for comparisons of more algorithms on multiple data sets, which is even more essential to typical machine learning studies, has been all but igno ..."
Abstract

Cited by 739 (0 self)
 Add to MetaCart
but ignored. This article reviews the current practice and then theoretically and empirically examines several suitable tests. Based on that, we recommend a set of simple, yet safe and robust nonparametric tests for statistical comparisons of classifiers: the Wilcoxon signed ranks test for comparison of two
Results 1  10
of
2,721,741