Sciweavers

2474 search results - page 115 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
IPPS
2009
IEEE
15 years 11 months ago
The Weak Mutual Exclusion problem
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
Paolo Romano, Luís Rodrigues, Nuno Carvalho
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
15 years 10 months ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
ATAL
2008
Springer
15 years 6 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
GLOBECOM
2006
IEEE
15 years 11 months ago
Multi-Stage Investment Decision under Contingent Demand for Networking Planning
Telecommunication companies, such as Internet and cellular service providers, are seeing rapid and uncertain growth of traffic routed through their networks. It has become a chall...
Miguel F. Anjos, Michael Desroches, Anwar Haque, O...
169
Voted
FOCS
1998
IEEE
15 years 9 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello