Sciweavers

1662 search results - page 197 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
COR
2007
95views more  COR 2007»
13 years 9 months ago
Inventory routing with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
TPDS
2002
134views more  TPDS 2002»
13 years 8 months ago
Performance of CORBA-Based Client-Server Architectures
Middleware has been introduced to provide interoperability as well as transparent location of servers in heterogeneous client-server environments. Although such benefits accrue fro...
Istabrak Abdul-Fatah, Shikharesh Majumdar
PODC
2004
ACM
14 years 2 months ago
On the expected payment of mechanisms for task allocation
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
Artur Czumaj, Amir Ronen
IPPS
2000
IEEE
14 years 1 months ago
A Parallel Co-evolutionary Metaheuristic
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...
Vincent Bachelet, El-Ghazali Talbi
ICCS
2003
Springer
14 years 2 months ago
Self-Adapting Numerical Software and Automatic Tuning of Heuristics
Self-Adapting Numerical Software (SANS) systems aim to bridge the knowledge gap that exists between the expertise of domain scientists, and the know-how that is needed to fulfill...
Jack Dongarra, Victor Eijkhout