4057 search results - page 786 / 812 » Linear combination of transformations |
SIGECOM
2003
ACM
14 years 26 days ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
AGENTS
2001
Springer
14 years 4 days ago
2001
Springer
Recent years are seeing an increasing need for on-line monitoring of deployed distributed teams of cooperating agents, e.g., for visualization, or performance tracking. However, i...
CCO
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
LCTRTS
2001
Springer
14 years 2 days ago
2001
Springer
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...
VLDB
2001
ACM
14 years 1 days ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...