Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
Jonathan W. Berry, Bruce Hendrickson, Simon Kahan,...
We derive optimal bidding strategies for a global bidding agent that participates in multiple, simultaneous second-price auctions with perfect substitutes. We first consider a mo...
Enrico H. Gerding, Rajdeep K. Dash, David C. K. Yu...
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...
Parallel to the societal diffusion of digital technologies, the debate on their impacts and requirements has created terms like ICT literacy, digital literacy or digital competenc...
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...