Results 11  20
of
27,761
The approximability of NPhard problems
 In Proceedings of the Annual ACM Symposium on Theory of Computing
, 1998
"... Many problems in combinatorial optimization are NPhard (see [60]). This has forced researchers to explore techniques for dealing with NPcompleteness. Some have considered algorithms that solve “typical” ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Many problems in combinatorial optimization are NPhard (see [60]). This has forced researchers to explore techniques for dealing with NPcompleteness. Some have considered algorithms that solve “typical”
Scheduling Algorithms for Multiprogramming in a HardRealTime Environment
, 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract

Cited by 3756 (3 self)
 Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...
The easiest hard problem
 Am. Sci
, 2002
"... 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 ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
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.
MAking Hard Problems Harder
, 2005
"... 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 f ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
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
Hard Problems in Similarity Searching
"... 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� ..."
Abstract
 Add to MetaCart
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
Consciousness in Robots: The Hard Problem and Some Less Hard Problems
"... 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 ..."
Abstract
 Add to MetaCart
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
An empirical investigation into the exceptionally hard problems
 Proc. Workshop on Constraintbased Reasoning
, 1995
"... 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 occ ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
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
Results 11  20
of
27,761