Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
86,131
Understanding Social Preferences with Simple Tests
, 2001
"... Departures from self-interest in economic experiments have recently inspired models of “social preferences”. We design a range of simple experimental games that test these theories more directly than existing experiments. Our experiments show that subjects are more concerned with increasing social w ..."
Abstract
-
Cited by 883 (41 self)
- Add to MetaCart
Departures from self-interest in economic experiments have recently inspired models of “social preferences”. We design a range of simple experimental games that test these theories more directly than existing experiments. Our experiments show that subjects are more concerned with increasing social
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- Artificial Intelligence
, 1995
"... The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments i ..."
Abstract
-
Cited by 1198 (12 self)
- Add to MetaCart
is precisely defined. We show that logic programming and nonmonotonic reasoning in AI are different forms of argumentation. We show that argumentation can be viewed as a special form of logic programming with negation as failure. This result introduces a general method for generating metainterpreters
On the optimality of the simple Bayesian classifier under zero-one loss
- MACHINE LEARNING
, 1997
"... The simple Bayesian classifier is known to be optimal when attributes are independent given the class, but the question of whether other sufficient conditions for its optimality exist has so far not been explored. Empirical results showing that it performs surprisingly well in many domains containin ..."
Abstract
-
Cited by 818 (27 self)
- Add to MetaCart
The simple Bayesian classifier is known to be optimal when attributes are independent given the class, but the question of whether other sufficient conditions for its optimality exist has so far not been explored. Empirical results showing that it performs surprisingly well in many domains
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 2182 (27 self)
- Add to MetaCart
. The core of this method is a simple hill-climbing algorithm that adjusts tree topology and branch lengths simultaneously. This algorithm starts from an initial tree built by a fast distance-based method and modifies this tree to improve its likelihood at each iteration. Due to this simultaneous adjustment
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 484 (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
Evaluating Future Microprocessors: the SimpleScalar Tool Set
, 1996
"... This document describes the SimpleScalar tool set, a collection of publicly-available 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 publicly-available 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
Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks
- in Proceedings of IEEE INFOCOM
, 2002
"... Mobile ad hoc networking has been an active research area for several years. How to stimulate cooperation among selfish mobile nodes, however, is not well addressed yet. In this paper, we propose Sprite, a simple, cheat-proof, creditbased system for stimulating cooperation among selfish nodes in mob ..."
Abstract
-
Cited by 484 (17 self)
- Add to MetaCart
Mobile ad hoc networking has been an active research area for several years. How to stimulate cooperation among selfish mobile nodes, however, is not well addressed yet. In this paper, we propose Sprite, a simple, cheat-proof, creditbased system for stimulating cooperation among selfish nodes
Do investment-cash flow sensitivities provide useful measures of financing constraints?
- QUARTERLY JOURNAL OF ECONOMICS
, 1997
"... No. This paper investigates the relationship between financing constraints and investment-cash flow sensitivities by analyzing the firms identified by Fazzari, Hubbard, and Petersen as having unusually high investment-cash flow sensitivities. We find that firms that appear less financially constra ..."
Abstract
-
Cited by 687 (7 self)
- Add to MetaCart
constrained exhibit significantly greater sensitivities than firms that appear more financially constrained. We find this pattern for the entire sample period, subperiods, and individual years. These results (and simple theoretical arguments) suggest that higher sensitivities cannot be interpreted as evidence
Achieving 100% Throughput in an Input-Queued Switch
- IEEE TRANSACTIONS ON COMMUNICATIONS
, 1996
"... It is well known that head-of-line (HOL) blocking limits the throughput of an input-queued switch with FIFO queues. Under certain conditions, the throughput can be shown to be limited to approximately 58%. It is also known that if non-FIFO queueing policies are used, the throughput can be increas ..."
Abstract
-
Cited by 527 (27 self)
- Add to MetaCart
be increased. However, it has not been previously shown that if a suitable queueing policy and scheduling algorithm are used then it is possible to achieve 100% throughput for all independent arrival processes. In this paper we prove this to be the case using a simple linear programming argument
A tutorial on support vector machines for pattern recognition
- Data Mining and Knowledge Discovery
, 1998
"... The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-separable data, working through a non-trivial example in detail. We describe a mechanical analogy, and discuss when SV ..."
Abstract
-
Cited by 3393 (12 self)
- Add to MetaCart
SVM solutions are unique and when they are global. We describe how support vector training can be practically implemented, and discuss in detail the kernel mapping technique which is used to construct SVM solutions which are nonlinear in the data. We show how Support Vector machines can have very
Results 1 - 10
of
86,131
