Sciweavers

3708 search results - page 95 / 742
» Approximating Betweenness Centrality
Sort
View
111
Voted
IAT
2005
IEEE
15 years 6 months ago
An Approximate Pareto Optimal Cooperative Negotiation Model for Multiple
Cooperative negotiation is proved to be an effective paradigm to solve complex dynamic multi-objective problems in which each objective is associated to an agent. When the multi-o...
Nicola Gatti, Francesco Amigoni
115
Voted
ATAL
2005
Springer
15 years 6 months ago
A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
Nicola Gatti, Francesco Amigoni
81
Voted
CDC
2009
IEEE
150views Control Systems» more  CDC 2009»
15 years 5 months ago
Cooperative adaptive sampling via approximate entropy maximization
— This work deals with a group of mobile sensors sampling a spatiotemporal random field whose mean is unknown and covariance is known up to a scaling parameter. The Bayesian pos...
Rishi Graham, Jorge Cortés
CP
2008
Springer
15 years 2 months ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon
ESA
2008
Springer
100views Algorithms» more  ESA 2008»
15 years 2 months ago
Improved Approximation Algorithms for Relay Placement
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
Alon Efrat, Sándor P. Fekete, Poornananda R...