Sciweavers

362 search results - page 40 / 73
» A distributed auction algorithm for the assignment problem
Sort
View
AAAI
2008
14 years 29 days ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
HASE
2008
IEEE
14 years 5 months ago
Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks
—In this paper, we investigate the transmission-power assignment problem for k-connected mobile ad hoc networks (MANETs), the problem of optimizing the lifetime of a MANET at a g...
Oliviero Riganelli, Radu Grosu, Samir R. Das, C. R...
COMPSAC
2011
IEEE
12 years 10 months ago
L1 - An Intermediate Language for Mixed-Protocol Secure Computation
—Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several ...
Axel Schröpfer, Florian Kerschbaum, Guenter M...
ATAL
2003
Springer
14 years 3 months ago
Trade of a problem-solving task
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
Shigeo Matsubara
MOBIHOC
2006
ACM
14 years 10 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu