Stack Overflow
Stack Overflow

Questions tagged [heuristics]

Heuristics refers to the use of algorithms to deal with highly complex problems.

Heuristics refers to the use of algorithms to deal with highly complex problems. A heuristic approach seeks to provide an approximate solution for a problem that is otherwise unsolvable.

683 questions
9
votes
3 answers

How should I design a good evaluation function for Connect 4?

I've a java implementation of "Connect 4" game (with a variable number of columns and rows) . This implementation use (according to the choice of the user) Mini-max algorithm of Mini-max with Alpha-beta pruning with a maximum depth of searching of…
dragonmnl
  • 14,578
  • 33
  • 84
  • 129
8
votes
2 answers

Best approach to a variation of a bucketing problem

Find the most appropriate team compositions for days in which it is possible. A set of n participants, k days, a team has m slots. A participant specifies how many days he wants to be a part of and which days he is available. Result…
SirWinning
  • 111
  • 8
8
votes
2 answers

QA generation on sub sentences - NLP

My dataset is structured like this: Product1 - Sentence1 Product2 - Sentence2 Product3 - Sentence3 . . etc The sentences look like this: Product1 - "We suggest that you wear this stylish piece with gold-toned drop earrings, churidar leggings and…
kaulmonish
  • 408
  • 5
  • 17
8
votes
6 answers

Heuristic algorithm for load balancing among threads

I'm working on a multi-threaded program where I have a number of worker threads performing tasks of unequal length. I want to load-balance the tasks to ensure that they do roughly the same amount of work. For each task Ti I have a number ci …
Il-Bhima
  • 10,744
  • 1
  • 47
  • 51
8
votes
1 answer

Forward planning heuristics - hmax, hadd, hff

I'm studying the forward planning heuristics hmax, hadd, and hff and I've found some resources online, but I really can't understand how they actually work. Here the resources I've found so far: http://icaps09.uom.gr/tutorials/tut1.pdf (An ICAPS…
The Condor
  • 1,034
  • 4
  • 16
  • 44
8
votes
2 answers

What is the difference between "hill climbing" and "branch-and-bound" search algorithms?

Hill-climbing search and branch-and-bound are two heuristic search algorithms used in artificial intelligence. What is the difference between these two approaches?
user1599964
  • 860
  • 2
  • 13
  • 29
7
votes
2 answers

When to use and not to use each development paradigm?

Given the various methodical approaches to development, can we get some heuristics together on which ones are appropriate in what circumstances, e.g. case-driven development model-driven development behavior-driven development test-driven…
Steven A. Lowe
  • 60,273
  • 18
  • 132
  • 202
7
votes
4 answers

Travelling Salesman with multiple salesmen with a limit on number of cities per salesman?

Problem: I need to drop (n) employees from office to their homes(co-ordinates available). I have (x) 7-seater & (y) 4-seater cabs available. I have to design an algorithm to drop all the employees to their homes while travelling minimum…
Pranav Mahajan
  • 2,048
  • 2
  • 23
  • 36
7
votes
5 answers

Optimizing locations of on-disk data for sequential access

I need to store large amounts of data on-disk in approximately 1k blocks. I will be accessing these objects in a way that is hard to predict, but where patterns probably exist. Is there an algorithm or heuristic I can use that will rearrange the…
sanity
  • 35,347
  • 40
  • 135
  • 226
7
votes
1 answer

Admissible Heuristic Manhattan Distance

I recently started an introductory course to Artificial Intelligence and I have been given an assignment to implement an admissible heuristic function in Python that solves the 15-Puzzle with A* search. I implemented the Manhattan Distance along…
dimlucas
  • 5,040
  • 7
  • 37
  • 54
7
votes
2 answers

Teleporting Traveler, Optimal Profit over time Problem

I'm new to the whole traveling-salesman problem as well as stackoverflow so let me know if I say something that isn't quite right. Intro: I'm trying to code a profit/time-optimized multiple-trade algorithm for a game which involves multiple cities…
Sleepingrock
  • 690
  • 5
  • 10
7
votes
2 answers

3-Opt Local Search for TSP?

I understand that the 3-Opt Heuristic involves removing three edges from a graph and adding three more to re-complete the tour. However, I've seen many papers that mention that when three edges are removed, there remain only 2 possible ways to…
u3l
  • 3,342
  • 4
  • 34
  • 51
7
votes
6 answers

In python, how can I distinguish between a human readable word and a random string?

Examples of words: ball encyclopedia tableau Examples of random strings: qxbogsac jgaynj rnnfdwpm Of course it may happen that a random string will actually be a word in some language or look like one. But basically a human being is able to say…
mnowotka
  • 16,430
  • 18
  • 88
  • 134
7
votes
2 answers

Heuristic for finding elements that appears often together in a big data set

Problem: I have a list of millions of transactions. Each transaction contains items (eg 'carrots', 'apples') the goal is to generate a list of pair of items that frequently occur together in individual transactions. As far as I can tell doing an…
RalleG
  • 115
  • 1
  • 6
7
votes
2 answers

Should I make my CouchDB database server public-facing?

I'm new to CouchDb and am trying to comprehend how to properly make use of it. I'm coming from MongoDB where I would always write a web layer and put it in front of mongo so that I could allow users to access the data inside of it, etc. In fact,…
Ryan
  • 7,733
  • 10
  • 61
  • 106
1 2 3
…
45 46