Sciweavers

2485 search results - page 252 / 497
» Time Bounded Frequency Computations
Sort
View
JMLR
2006
117views more  JMLR 2006»
13 years 8 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
13 years 8 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
RTAS
2010
IEEE
13 years 6 months ago
Selecting Server Parameters for Predictable Runtime Monitoring
—Application of runtime monitoring to maintain the health of an embedded real-time software system requires that anomalous behavior be detected within a bounded time while preser...
Haitao Zhu, Steve Goddard, Matthew B. Dwyer
FOCS
2009
IEEE
14 years 3 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
ICIP
2004
IEEE
14 years 10 months ago
Face detection in the compressed domain
Face detection is important in many algorithms in the areas of machine object recognition and pattern recognition. The kaleidoscope of applications for face detection extends acro...
Pedro Fonseca, Jan Nesvadba