Sciweavers

6315 search results - page 19 / 1263
» Approximating Solution Structure
Sort
View
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
15 years 7 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
88
Voted
ICASSP
2008
IEEE
15 years 7 months ago
A new Particle Filtering algorithm with structurally optimal importance function
Bayesian estimation in nonlinear stochastic dynamical systems has been addressed for a long time. Among other solutions, Particle Filtering (PF) algorithms propagate in time a Mon...
Boujemaa Ait-El-Fquih, François Desbouvries
95
Voted
DISOPT
2006
118views more  DISOPT 2006»
15 years 22 days ago
Improved bounds for vehicle routing solutions
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
Agustín Bompadre, Moshe Dror, James B. Orli...
108
Voted
ANTSW
2006
Springer
15 years 4 months ago
Kernelization as Heuristic Structure for the Vertex Cover Problem
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
Stephen Gilmour, Mark Dras