Results 1  10
of
301,336
Simple Heuristics That Make Us Smart
, 2008
"... To survive in a world where knowledge is limited, time is pressing, and deep thought is often an unattainable luxury, decisionmakers must use bounded rationality. In this precis of Simple heuristics that make us smart, we explore fast and frugal heuristics—simple rules for making decisions with re ..."
Abstract

Cited by 449 (15 self)
 Add to MetaCart
To survive in a world where knowledge is limited, time is pressing, and deep thought is often an unattainable luxury, decisionmakers must use bounded rationality. In this precis of Simple heuristics that make us smart, we explore fast and frugal heuristics—simple rules for making decisions
Simple heuristics for unit disk graphs
 NETWORKS
, 1995
"... Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NPhard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring ..."
Abstract

Cited by 151 (6 self)
 Add to MetaCart
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NPhard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum
Simple Heuristics for Concept Combination
"... In psychology, concepts are typically characterized as those bodies of knowledge that are used by default in the psychological processes underlying numerous higher cognitive competences, such as categorization, induction, language understanding, analogymaking, and so on (Machery, In Press). These co ..."
Abstract
 Add to MetaCart
). The outcome of this process is said to be a “complex concept, ” while the concepts permanently stored in longterm memory are said to be “simple concepts. ” 1 Psychologists interested in concepts have studied at length the psychological phenomena associated with concept combination in order to better
Simple heuristics and the modelling of crowd behaviours
"... A crowd of pedestrians is a complex system that exhibits a rich variety of selforganized collective behaviors, such as lane formation, stopandgo waves, or crowd turbulence. Understanding the mechanisms of crowd dynamics requires establishing a link between the local behavior of pedestrians during ..."
Abstract
 Add to MetaCart
by the pedestrian during navigation. Here, we will describe and compare two representatives of outcome and process models, namely the social force model on the one hand, and the heuristic model on the other hand. In particular, we will describe the strength and the limitations of each approach, and discuss possible
Simple Heuristics for the Choquet Integral Classifier
"... The Choquet Integral is a successful classification method. However, like other methods, when applied to large data sets where many coefficients have to be optimised, search methods such as genetic algorithms (GA) are used. In this paper, heuristics are developed that can achieve reasonably accurate ..."
Abstract
 Add to MetaCart
The Choquet Integral is a successful classification method. However, like other methods, when applied to large data sets where many coefficients have to be optimised, search methods such as genetic algorithms (GA) are used. In this paper, heuristics are developed that can achieve reasonably
Analysis Of Two Simple Heuristics On A Random Instance Of kSAT
 Journal of Algorithms
, 1996
"... We consider the performance of two algorithms, GUC and SC studied by Chao and Franco [2], [3], and Chv'atal and Reed [4], when applied to a random instance ! of a boolean formula in conjunctive normal form with n variables and bcnc clauses of size k each. For the case where k = 3, we obtain th ..."
Abstract

Cited by 147 (4 self)
 Add to MetaCart
Given a boolean formula ! in conjunctive normal form, the satisfiability problem (sat) is to determine whether there is a truth assignment that satisfies !. Since sat is NPcomplete, one is interested in efficient heuristics that perform well "on average," or with high probability. The choice
A Simple Heuristically Guided Search for the Timetable Problem
 In: Proceedings of the International ICSC Symposium on Engineering of Intelligent Systems, Univ. of La Laguna
, 1998
"... Domain specific heuristics have been utilised in solutions to the timetable ever since the first attempts at automation were made[foxley68, cole64]. While methods incorporating heuristics generally produce quite acceptable results in a very small CPU time they lack the optimisation capabilities of t ..."
Abstract

Cited by 29 (10 self)
 Add to MetaCart
of the more CPU intensive search methods. In this paper we will outline a simple efficient technique based on heuristics that includes a variable degree of nondeterminism to facilitate a search through the solution space. Careful use of heuristics should mean that this simple search technique will target more
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
 ARTIF. INTELL
, 1992
"... This paper describes a simple heuristic approach to solving largescale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a valueorderin ..."
Abstract

Cited by 457 (6 self)
 Add to MetaCart
This paper describes a simple heuristic approach to solving largescale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value
An effective and simple heuristic for the set covering problem
, 2007
"... This paper investigates the development of an effective heuristic to solve the set covering problem (SCP) by applying the metaheuristic MetaRaPS (Metaheuristic for Randomized Priority Search). In MetaRaPS, a feasible solution is generated by introducing random factors into a construction method. ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
to find all optimal/ best known solutions for those nonunicost instances. In addition, this heuristic is the best for unicost problems among the heuristics in terms of solution quality. Furthermore, evolving from a simple greedy heuristic, it is simple and easy to code. This heuristic enriches
Results 1  10
of
301,336