Sciweavers

1110 search results - page 8 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
AISS
2010
113views more  AISS 2010»
14 years 7 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»
14 years 7 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
IAT
2006
IEEE
15 years 4 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
SPLC
2008
14 years 11 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
ATAL
2008
Springer
15 years 11 days ago
Approximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
Benito Mendoza García, José M. Vidal