Sciweavers

2542 search results - page 277 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
90
Voted
ATAL
2007
Springer
15 years 6 months ago
Approximate and online multi-issue negotiation
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
NJC
2006
125views more  NJC 2006»
15 years 14 days ago
PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms
Abstract. We present a new parallel computation model called the Parallel ResourceOptimal computation model. PRO is a framework being proposed to enable the design of efficient and...
Assefaw Hadish Gebremedhin, Mohamed Essaïdi, ...
104
Voted
HPDC
2009
IEEE
15 years 7 months ago
Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
Björn Saballus, Thomas Fuhrmann
119
Voted
EOR
2011
140views more  EOR 2011»
14 years 4 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
227
Voted
SIGCOMM
2012
ACM
13 years 3 months ago
Abstractions for network update
ions for Network Update Mark Reitblatt Cornell Nate Foster Cornell Jennifer Rexford Princeton Cole Schlesinger Princeton David Walker Princeton Configuration changes are a common...
Mark Reitblatt, Nate Foster, Jennifer Rexford, Col...