9842 search results - page 302 / 1969 » Problem complexity |
165
click to vote
STACS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
176
click to vote
FOCS
2005
IEEE
16 years 12 days ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
196
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
175
click to vote
AAAI
2000
15 years 8 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
198
click to vote
ICALT
2005
IEEE
16 years 12 days ago
2005
IEEE
Problem-based learning is a pedagogical strategy that centers learning activities around the investigation and development of solutions to complex and ill-structured authentic pro...