10901 search results - page 124 / 2181 » Approximations in Distributed Optimization |
155
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
205
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
167
click to vote
TWC
2008
15 years 6 months ago
2008
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 success...
159
click to vote
VLSID
2002
IEEE
16 years 6 months ago
2002
IEEE
The improved T and improved n models are proposed for onchip interconnect macromodeling. Using global approximations, simple approximation frames are derived and applied to modeli...
150
click to vote
IPCCC
2006
IEEE
16 years 13 days ago
2006
IEEE
Recent work on distributed RAM sharing has largely focused on leveraging low-latency networking technologies to optimize remote memory access. In contrast, we revisit the idea of ...