Sciweavers

4229 search results - page 472 / 846
» On the Optimality of Spiral Search
Sort
View
151
Voted
APL
1998
ACM
15 years 11 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
OOPSLA
1997
Springer
15 years 11 months ago
Query-Based Debugging of Object-Oriented Programs
Object relationships in modern software systems are becoming increasingly numerous and complex. Programmers who try to find violations of such relationships need new tools that al...
Raimondas Lencevicius, Urs Hölzle, Ambuj K. S...
151
Voted
DATE
2004
IEEE
147views Hardware» more  DATE 2004»
15 years 10 months ago
Automatic Tuning of Two-Level Caches to Embedded Applications
The power consumed by the memory hierarchy of a microprocessor can contribute to as much as 50% of the total microprocessor system power, and is thus a good candidate for optimiza...
Ann Gordon-Ross, Frank Vahid, Nikil Dutt
ECAI
2000
Springer
15 years 10 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
CPAIOR
2008
Springer
15 years 8 months ago
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
Alex S. Fukunaga