Sciweavers

498 search results - page 58 / 100
» Cooperation with Complement is Better
Sort
View
ECAI
2008
Springer
15 years 2 months ago
Dynamic Backtracking for Distributed Constraint Optimization
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
Redouane Ezzahir, Christian Bessiere, Imade Benela...
109
Voted
IADIS
2003
15 years 1 months ago
Computing Migration Through Context Awareness and Context Transmission
With the development of wireless communication and portable devices, people can now enjoy the benefits of mobile computing. But due to the nature and design of portable devices, i...
Zhaohui Cheng, Kenneth Chin, Yuan Luo
102
Voted
IJCAI
2003
15 years 1 months ago
Improving Coevolutionary Search for Optimal Multiagent Behaviors
Evolutionary computation is a useful technique for learning behaviors in multiagent systems. Among the several types of evolutionary computation, one natural and popular method is...
Liviu Panait, R. Paul Wiegand, Sean Luke
100
Voted
ECSCW
1993
15 years 1 months ago
Design for Unanticipated Use..
: Support for work practice is better conceptualised as support for activity taking place in a multidimensional space than as prescription of temporal task sequences. The notion of...
Mike Robinson
72
Voted
JUCS
2007
104views more  JUCS 2007»
15 years 10 days ago
Achieving Atomicity for Web Services Using Commutativity of Actions
: Web Services enable the creation of complex business activities through the cooperation of independently developed software programs. However, Web Services incur the risk of long...
P. Michael Melliar-Smith, Louise E. Moser