16404 search results - page 341 / 3281 » A set coverage problem |
126
click to vote
HICSS
2003
IEEE
15 years 10 months ago
2003
IEEE
We adopt the decision-theoretic principle of expected utility maximization as a paradigm for designing autonomous rational agents operating in multi-agent environments. We use the...
163
Voted
GCC
2003
Springer
15 years 10 months ago
2003
Springer
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
130
click to vote
ICIP
1998
IEEE
15 years 9 months ago
1998
IEEE
: While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when ap...
141
click to vote
PKDD
1999
Springer
15 years 9 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
137
click to vote
DBPL
1997
Springer
15 years 9 months ago
1997
Springer
We examine the power of incremental evaluation systems that use an SQL-like language for maintaining recursively-de ned views. We show that recursive queries such as transitive clo...