Sciweavers

3250 search results - page 250 / 650
» An Algorithm to Solve a Linear Program
Sort
View
CCCG
2003
15 years 8 months ago
Multidimensional Orthogonal Range Search Using Tries
We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to sol...
Lingke Bu, Bradford G. Nickerson

Lecture Notes
443views
17 years 4 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
IJCAI
2003
15 years 8 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
CC
2007
Springer
157views System Software» more  CC 2007»
16 years 1 months ago
New Algorithms for SIMD Alignment
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
Liza Fireman, Erez Petrank, Ayal Zaks
ESOP
2010
Springer
16 years 4 months ago
Amortized Resource Analysis with Polynomial Potential - A Static Inference of Polynomial Bounds for Functional Programs
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
Jan Hoffmann and Martin Hofmann