626 search results - page 89 / 126 » On Approximability of Minimum Bisection Problem |
GD
2007
Springer
14 years 3 months ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
ICIP
1999
IEEE
14 years 2 months ago
1999
IEEE
Optical diffusion tomography attempts to reconstruct an object cross section from measurements of scattered and attenuated light. While Bayesian approaches are well suited to this...
ESANN
2008
13 years 11 months ago
2008
Using multilayer perceptrons (MLPs) to approximate the state-action value function in reinforcement learning (RL) algorithms could become a nightmare due to the constant possibilit...
TWC
2008
13 years 9 months ago
2008
It is a challenging task for multi-hop wireless networks to support multimedia applications with quality-ofservice (QoS) requirements. This letter presents a joint crosslayer optim...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...