Sciweavers

151 search results - page 16 / 31
» Dynamic Backtracking for Distributed Constraint Optimization
Sort
View
DEBS
2009
ACM
13 years 11 months ago
Efficient event-based resource discovery
The ability to find services or resources that satisfy some criteria is an important aspect of distributed systems. This paper presents an event-based architecture to support more...
Wei Yan, Songlin Hu, Vinod Muthusamy, Hans-Arno Ja...
ICASSP
2011
IEEE
12 years 11 months ago
Distributed LCMV beamforming in wireless sensor networks with node-specific desired signals
We consider distributed linearly constrained minimum variance (LCMV) beamforming in a wireless sensor network. Each node computes an LCMV beamformer with node-specific constraint...
Alexander Bertrand, Marc Moonen
INFOCOM
2003
IEEE
14 years 27 days ago
Optimal Bandwidth Reservation Schedule in Cellular Network
Abstract— Efficient bandwidth allocation strategy with simultaneous fulfillment of QoS requirement of a user in a mobile cellular network is still a critical and an important p...
Samrat Ganguly, B. R. Badrinath, Navin Goyal
ATAL
2003
Springer
14 years 25 days ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen