Sciweavers

227 search results - page 9 / 46
» Weighted Coloring: Further Complexity and Approximability Re...
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
HVEI
2010
13 years 9 months ago
Perceptual quality assessment of color images using adaptive signal representation
Perceptual image distortion measures can play a fundamental role in evaluating and optimizing imaging systems and image processing algorithms. Many existing measures are formulate...
Umesh Rajashekar, Zhou Wang, Eero P. Simoncelli
IJON
2007
184views more  IJON 2007»
13 years 7 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
SOFSEM
2010
Springer
14 years 4 months ago
On the Complexity of the Highway Pricing Problem
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
Alexander Grigoriev, Joyce van Loon, Marc Uetz
COCO
2008
Springer
88views Algorithms» more  COCO 2008»
13 years 9 months ago
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
Kord Eickmeyer, Martin Grohe, Magdalena Grübe...