2061 search results - page 50 / 413 » The continuous knapsack set |
108
click to vote
DASFAA
2007
IEEE
15 years 1 months ago
2007
IEEE
To support emerging database applications that deal with continuously changing (or moving) data objects (CCDOs), such as vehicles, RFIDs, and multi-stimuli sensors, one requires an...
102
click to vote
LFP
1992
15 years 1 months ago
1992
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
105
click to vote
TKDE
2008
14 years 11 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
CCE
2004
14 years 11 months ago
2004
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
106
click to vote
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from point s...