14548 search results - page 2683 / 2910 » The Optimal Path-Matching Problem |
184
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...
194
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
183
click to vote
CAEPIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buyers when trying to determine the best set of prov...
158
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
228
click to vote
CRYPTO
2003
Springer
15 years 11 months ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...