MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The Change-Making Problem." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

26 documents found, showing 1 through 10. Next 10 →

ATOM

Optimal Bounds for the Change-Making Problem
by Dexter Kozen, Shmuel Zaks — 1994
…Optimal Bounds for the Change-Making Problem Dexter Kozen 1 and Shmuel Zaks 2 1 Computer…
Cited by 8 (0 self) – Add To MetaCart

A Polynomial-time Algorithm for the Change-Making Problem
by David Pearson — 1994 — Department of Computer Science, Cornell University
…A Polynomial-time Algorithm for the Change-Making Problem David Pearson Computer Science…
Cited by 6 (0 self) – Add To MetaCart

Parallel Execution of Irregular Meshes Into a Systolic Linear Array
by S. Fidanova, A. Goldman
… are irregular meshes. These include the unbounded knapsack problem, the subset sum problem, the change making…
Add To MetaCart

Experiments with Parallel Algorithms for Combinatorial Problems
by G. A. P. Kindervater, H. W. J. M. Trienekens — 1985 — European Journal of Operational Research
… Combinatorial Algorithms 3.1. Change-Making Change-making is the following combinatorial problem: given a…
Cited by 3 (1 self) – Add To MetaCart

Experiments with Parallel Algorithms for Combinatorial Problems
by Kindervater Centre For, G. A. P. Kindervater, H. W. J. M. Trienekens — 1985 — European Journal of Operational Research
… Combinatorial Algorithms 3.1. Change-Making Change-making is the following combinatorial problem: given a…
Add To MetaCart

Applying Belief Change to Ontology Evolution Giorgos Flouris
by Institute Of Computer, Giorgos Flouris — 2006 — University of Crete
… change; this makes the problem of ontology evolution very similar, in several aspects, to belief change…
Add To MetaCart

An optimization framework for scheduling of embedded real-time systems
by Cecilia Ekelin — 2004
…. Acronyms B&B branch-and-bound BCMP bounded change-making problem CC communication clustering CP constraint…
Cited by 7 (0 self) – Add To MetaCart

Knapsack on VLSI: from Algorithm to Optimal Circuit
by Rumen Andonov, Sanjay Rajopadhye — 1997 — IEEE Transactions on Parallel and Distributed Systems
… ), the change making problem, etc. They arise in different application domains, and are all NP-hard. The most…
Cited by 1 (0 self) – Add To MetaCart

Ritter, F. E. (1995). Review of "Soar: An architecture in perspective". Philosophical Psychology, 8(3), 301-305.
by Book Review For, Frank E. Ritter
… and deliberate learning must also be performed to reject the bad operators. All of these changes make the problem…
Add To MetaCart

Natural Interpolation of Time Series
by Lars Kindermann, Achim Lewandowski — 2003 — BSIS Technical Reports 03-3, RIKEN Brain Science Institute, Lab for Mathematical Neuroscience, Japan ÖFAI
…: exponential growth. But a little change makes the problem much more difficult: If we expect a mixture…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB