Sciweavers

3019 search results - page 49 / 604
» Approximating the Domatic Number
Sort
View
VLDB
2002
ACM
113views Database» more  VLDB 2002»
16 years 1 days ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
INFOCOM
2007
IEEE
15 years 6 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad-hoc Networks
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
Atef Abdrabou, Weihua Zhuang
ESA
2008
Springer
100views Algorithms» more  ESA 2008»
15 years 1 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...
WSC
2004
15 years 1 months ago
Approximating Free Exercise Boundaries for American-Style Options Using Simulation and Optimization
Monte Carlo simulation can be readily applied to asset pricing problems with multiple state variables and possible path dependencies because convergence of Monte Carlo methods is ...
Barry R. Cobb, John M. Charnes
FUIN
2010
143views more  FUIN 2010»
14 years 9 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer