Sciweavers

3208 search results - page 351 / 642
» A Lower Bound for Primality
Sort
View
204
Voted
JMLR
2006
117views more  JMLR 2006»
15 years 6 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
NETWORKS
2008
15 years 6 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
JC
2007
94views more  JC 2007»
15 years 6 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
COMBINATORICA
2007
119views more  COMBINATORICA 2007»
15 years 6 months ago
Complete partitions of graphs
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
Magnús M. Halldórsson, Guy Kortsarz,...
SPIRE
2010
Springer
15 years 5 months ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...