Results 1  10
of
2,666,643
WellSolvable Special Cases of the TSP: A Survey
, 1995
"... The Traveling Salesman Problem belongs to the most important and most investigated problems in combinatorial optimization. Although it is an NPhard problem, many of its special cases can be solved efficiently. We survey these special cases with emphasis on results obtained during the decade 19851 ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
The Traveling Salesman Problem belongs to the most important and most investigated problems in combinatorial optimization. Although it is an NPhard problem, many of its special cases can be solved efficiently. We survey these special cases with emphasis on results obtained during the decade 1985
Efficiently Solvable Special Cases of Hard Combinatorial Optimization Problems
, 1997
"... We survey some recent advances in the field of polynomially solvable special cases of hard combinatorial optimization problems like the travelling salesman problem, quadratic assignment problems and Steiner tree problems. Such special cases can be found by considering special cost structures, the ge ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We survey some recent advances in the field of polynomially solvable special cases of hard combinatorial optimization problems like the travelling salesman problem, quadratic assignment problems and Steiner tree problems. Such special cases can be found by considering special cost structures
mmedian and mcenter problems with mutual communication: solvable special cases
 Operations Research
, 1992
"... George Monahan, and RichMmedian and Mcenter Problems with Mutual Communication: ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
George Monahan, and RichMmedian and Mcenter Problems with Mutual Communication:
An Efficiently Solvable Special Case of the 3Dimensional Bottleneck Assignment Problem (Extended Abstract)
, 1995
"... Problem statement. Given an n \Theta n \Theta n cost array C = (c ijk ) of arbitrary real numbers, the wellknown 3dimensional axial assignment problem, 3AP for short, is to find two permutations OE and / of the set f1; : : : ; ng such that the sum P n i=1 c iOE(i)/(i) is minimized. The 3dimen ..."
Abstract
 Add to MetaCart
. Both 3AP and 3BAP are known to be NPhard and even hard to approximate. For this reason several researchers tried to identify special cases which can be solved in polynomial time. Most of the results known in this area, however, are of negati...
Short Communication Inapproximability and a polynomially solvable special case of a network improvement problem q
, 2000
"... ..."
Worstcase equilibria
 IN PROCEEDINGS OF THE 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
, 1999
"... In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a ver ..."
Abstract

Cited by 851 (17 self)
 Add to MetaCart
In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a very simple network leads to some interesting mathematics, results, and open problems.
The case for motivated reasoning
 Psychological Bulletin
, 1990
"... It is proposed that motivation may affect reasoning through reliance on a biased set of cognitive processes—that is, strategies for accessing, constructing, and evaluating beliefs. The motivation to be accurate enhances use of those beliefs and strategies that are considered most appropriate, wherea ..."
Abstract

Cited by 687 (3 self)
 Add to MetaCart
It is proposed that motivation may affect reasoning through reliance on a biased set of cognitive processes—that is, strategies for accessing, constructing, and evaluating beliefs. The motivation to be accurate enhances use of those beliefs and strategies that are considered most appropriate, whereas the motivation to arrive at particular conclusions enhances use of those that are considered most likely to yield the desired conclusion. There is considerable evidence that people are more likely to arrive at conclusions that they want to arrive at, but their ability to do so is constrained by their ability to construct seemingly reasonable justifications for these conclusions. These ideas can account for a wide variety of research concerned with motivated reasoning. The notion that goals or motives affect reasoning has a long and controversial history in social psychology. The propositions that motives may affect perceptions (Erdelyi, 1974), attitudes (Festinger, 1957), and attributions (Heider, 1958) have been put forth by some psychologists and challenged by others. Although early researchers and theorists took it for granted that motivation may cause people to make selfserving attributions
Using Daily Stock Returns: The Case of Event Studies
 Journal of Financial Economics
, 1985
"... This paper examines properties of daily stock returns and how the particular characteristics of these data affect event study methodologies. Daily data generally present few difficulties for event studies. Standard procedures are typically wellspecified even when special daily data characteristics ..."
Abstract

Cited by 763 (2 self)
 Add to MetaCart
This paper examines properties of daily stock returns and how the particular characteristics of these data affect event study methodologies. Daily data generally present few difficulties for event studies. Standard procedures are typically wellspecified even when special daily data characteris
The empirical case for two systems of reasoning
, 1996
"... Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations ref ..."
Abstract

Cited by 631 (4 self)
 Add to MetaCart
Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations reflect similarity structure and relations of temporal contiguity. The other is “rule based” because it operates on symbolic structures that have logical content and variables and because its computations have the properties that are normally assigned to rules. The systems serve complementary functions and can simultaneously generate different solutions to a reasoning problem. The rulebased system can suppress the associative system but not completely inhibit it. The article reviews evidence in favor of the distinction and its characterization.
A case study of open source software development: the Apache server
 In: Proceedings of the 22nd International Conference on Software Engineering (ICSE 2000
, 2000
"... According to its proponents, open source style software development has the capacity to compete successfully, and perhaps in many cases displace, traditional commercial development methods. In order to begin investigating such claims, we examine the development process of a major open source applica ..."
Abstract

Cited by 787 (31 self)
 Add to MetaCart
According to its proponents, open source style software development has the capacity to compete successfully, and perhaps in many cases displace, traditional commercial development methods. In order to begin investigating such claims, we examine the development process of a major open source
Results 1  10
of
2,666,643