5214 search results - page 316 / 1043 » The Online Specialization Problem |
163
click to vote
IJCAI
2001
15 years 8 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
171
click to vote
IJCAI
2001
15 years 8 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
154
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We suggest a new, unconventional, way for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build a device which can ...
177
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
With the explosive growth and spread of Internet, web access from mobile and rural users has become significant. But these users face problems of low bandwidth and intermittent In...
180
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...