Sciweavers

6 search results - page 1 / 2
» An Options-Based Method to Solve the Composability Problem i...
Sort
View
AMEC
2004
Springer
13 years 10 months ago
An Options-Based Method to Solve the Composability Problem in Sequential Auctions
Abstract. Current auctions often expose bidding agents to two difficult, yet common, problems. First, bidding agents often have the opportunity to participate in successive auctio...
Adam I. Juda, David C. Parkes
WSC
2008
13 years 7 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese
AISS
2010
113views more  AISS 2010»
13 years 2 months ago
The Object Replication Method for the Efficient Migration of Agent
The migration method of a mobile agent affects the entire performance of the distributed system. Most of the existing migration methods have the slow-witted structures due to the ...
Yonsik Lee, Kwangwoo Nam
IJACTAICIT
2010
169views more  IJACTAICIT 2010»
13 years 2 months ago
The Migration of Mobile Agent Using the Object Replication
The migration method of a mobile agent affects the entire performance of the distributed system. Most of the existing migration methods have the slow-witted structures due to the ...
Yonsik Lee, Jeongsu Lee
IPPS
2006
IEEE
13 years 11 months ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...