Sciweavers

16404 search results - page 406 / 3281
» A set coverage problem
Sort
View
ISMIR
2004
Springer
157views Music» more  ISMIR 2004»
16 years 2 days ago
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
Anna Lubiw, Luke Tanur
ICMAS
2000
15 years 8 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
JMIV
2008
106views more  JMIV 2008»
15 years 6 months ago
Estimation of Vector Fields in Unconstrained and Inequality Constrained Variational Problems for Segmentation and Registration
Vector fields arise in many problems of computer vision, particularly in non-rigid registration. In this paper, we develop coupled partial differential equations (PDEs) to estimat...
Gozde B. Unal, Greg G. Slabaugh
NETWORKS
2006
15 years 6 months ago
The multiroute maximum flow problem revisited
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
Donglei Du, R. Chandrasekaran
HEURISTICS
2010
15 years 4 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill