Sciweavers

88 search results - page 11 / 18
» Determining Successful Negotiation Strategies: An Evolutiona...
Sort
View
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
13 years 11 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
AI
2010
Springer
13 years 5 months ago
Agent decision-making in open mixed networks
Computer systems increasingly carry out tasks in mixed networks, that is in group settings in which they interact both with other computer systems and with people. Participants in...
Ya'akov Gal, Barbara J. Grosz, Sarit Kraus, Avi Pf...
P2P
2008
IEEE
14 years 1 months ago
On the Impact of Greedy Strategies in BitTorrent Networks: The Case of BitTyrant
The success of BitTorrent has fostered the development of variants to its basic components. Some of the variants adopt greedy approaches aiming at exploiting the intrinsic altruis...
Damiano Carra, Giovanni Neglia, Pietro Michiardi
COR
2007
112views more  COR 2007»
13 years 7 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
TSC
2008
140views more  TSC 2008»
13 years 7 months ago
Dynamic Web Service Selection for Reliable Web Service Composition
This paper studies the dynamic Web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at runtime so as to succ...
San-Yih Hwang, Ee-Peng Lim, Chien-Hsiang Lee, Chen...