Many problems in combinatorial optimization are NP-hard (see [60]). This has forced researchers to explore techniques for dealing with NP-completeness. Some have considered algorithms that solve “typical”

The problem of multiprogram scheduling on a single processor is studied from the viewpoint...

One of the cherished customs of childhood is choosing up sides for a ball game. Where I grew up, we did it this way: The two chief bullies of the neighborhood would appoint themselves captains of the opposing teams, and then they would take turns picking other players. On each round, a captain would choose the most capable (or, toward the end, the least inept) player from the pool of remaining candidates, until everyone present had been assigned to one side or the other. The aim of this ritual was to produce two evenly matched teams and, along the way, to remind each of us of our precise ranking in the neighborhood pecking order. It usually worked.

We present a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corresponding notions from the computational theory of randomness. A hardness condenser is a procedure that takes in a Boolean

The Closest Substring Problem is one of the most important problems in the field of computational biology. It is stated as follows: given a set ofØsequences ×�×����×Øover an alphabet¦, and two integers���with���, can one find a string×of length�and, for all��������Ø, substringsÓ�of×�, all of length

Wisdom of artificial crowds algorithm for solving

Abstract not found

Abstract not found

Abstract – Based on results from evolutionary psychology we discuss important functions that can be served by consciousness in autonomous robots. We distinguish intrinsic intentionality from consciousness, but argue it is also important. Finally we explore the Hard Problem for robots (i.e., whether

Recently \exceptionally hard " problems have been found in the easy region of problem spaces which can be orders of magnitude harder to solve than even the hardest problems in the phase transistion. However there is some uncertainty over whether this phenomena of exceptionally hard problems