126 search results - page 17 / 26 » Surrogate constraint normalization for the set covering prob... |
MVA
1990
13 years 8 months ago
1990
This paper describes work done as part of the Oxford AGV (Autonomous Guided Vehicle) project [2] towards recognition of classes of objects to be encountered in a factory environme...
CPC
2006
13 years 7 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
DKE
2002
13 years 7 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
SIAMCOMP
1998
13 years 7 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
AMAI
2005
Springer
13 years 7 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...