Sciweavers

AAAI
2008
14 years 2 months ago
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
AAAI
2008
14 years 2 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
FPGA
1995
ACM
107views FPGA» more  FPGA 1995»
14 years 4 months ago
Multi-way System Partitioning into a Single Type or Multiple Types of FPGAs
This paper considers the problem of partitioning a circuit into a collection of subcircuits, such that each subcircuit is feasible for some device from an FPGA library, and the to...
Dennis J.-H. Huang, Andrew B. Kahng
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
14 years 4 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
LATIN
1998
Springer
14 years 4 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 4 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
CHI
1998
ACM
14 years 4 months ago
Exploring Browser Design Trade-Offs Using a Dynamical Model of Optimal Information Foraging
Designers and researchers of human-computer interaction need tools that permit the rapid exploration and management of hypotheses about complex interactions of designs, task condi...
Peter Pirolli
SCCC
1998
IEEE
14 years 4 months ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...
ESOP
1999
Springer
14 years 4 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
14 years 4 months ago
Explaining and Controlling Ambiguity in Dynamic Programming
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...
Robert Giegerich