Sciweavers

9842 search results - page 350 / 1969
» Problem complexity
Sort
View
DISOPT
2008
74views more  DISOPT 2008»
15 years 7 months ago
George B. Dantzig and systems optimization
We pay homage to George B. Dantzig by describing a less well known part of his legacy--his early and dedicated championship of the importance of systems optimization in solving co...
Philip E. Gill, Walter Murray, Michael A. Saunders...
ADBIS
2009
Springer
148views Database» more  ADBIS 2009»
16 years 1 months ago
On Containment of Conjunctive Queries with Negation
Abstract. We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the ...
Victor Felea
ICIP
2003
IEEE
16 years 8 months ago
Efficient frame vector selection based on ordered sets
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
Tom Ryen, Guido M. Schuster, Aggelos K. Katsaggelo...
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
16 years 27 days ago
Optimizing Multiple Queries in Distributed Data Stream Systems
We consider the problem of query optimization in distributed stream based systems where multiple continuous queries may be executing simultaneously. In such systems, distribution ...
Sangeetha Seshadri, Vibhore Kumar, Brian F. Cooper
ESA
2008
Springer
127views Algorithms» more  ESA 2008»
15 years 8 months ago
The Alcuin Number of a Graph
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
Péter Csorba, Cor A. J. Hurkens, Gerhard J....