Sciweavers

295 search results - page 53 / 59
» Games and Definability for System F
Sort
View
ATAL
2007
Springer
13 years 11 months ago
Model-based belief merging without distance measures
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
Verónica Borja Macías, Pilar Pozos P...
TON
2002
91views more  TON 2002»
13 years 7 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
CSCW
2004
ACM
14 years 28 days ago
Assembling the senses: towards the design of cooperative interfaces for visually impaired users
The needs of blind and visually impaired users are seriously under-investigated in CSCW. We review work on assistive interfaces especially concerning how collaboration between sig...
Fredrik Winberg, John Bowers
EMSOFT
2004
Springer
14 years 27 days ago
Reactive process networks
Data flow process networks are a good model of computation for streaming multimedia applications incorporating audio, video and/or graphics streams. Process networks are concurre...
Marc Geilen, Twan Basten
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 7 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...