Sciweavers

1012 search results - page 185 / 203
» What Robots Can Do
Sort
View
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
k-Implementation
This paper discusses an interested party who wishes to influence the behavior of agents in a game (multi-agent interaction), which is not under his control. The interested party ...
Dov Monderer, Moshe Tennenholtz
INFOCOM
1999
IEEE
14 years 24 days ago
Supporting Dynamic Inter-Class Resource Sharing: A Multi-Class QoS Routing Algorithm
In an integrated services network, resources are shared by multiple traffic classes. Service classes that deliver guaranteed Quality-ofService (QoS) to applications have priority ...
Qingming Ma, Peter Steenkiste
HPDC
1997
IEEE
14 years 22 days ago
A Secure Communications Infrastructure for High-Performance Distributed Computing
We describe a software infrastructure designed to support the development of applications that use high-speed networks to connect geographically distributed supercomputers, databa...
Ian T. Foster, Nicholas T. Karonis, Carl Kesselman...
MPC
2010
Springer
174views Mathematics» more  MPC 2010»
14 years 15 days ago
Matrices as Arrows!
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
Hugo Daniel Macedo, José Nuno Oliveira