Sciweavers

1429 search results - page 38 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng
MOR
2006
95views more  MOR 2006»
13 years 7 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
ICPP
2007
IEEE
14 years 1 months ago
Architectural Challenges in Memory-Intensive, Real-Time Image Forming
The real-time image forming in future, high-end synthetic aperture radar systems is an example of an application that puts new demands on computer architectures. The initial quest...
Anders Ahlander, H. Hellsten, K. Lind, J. Lindgren...
ICASSP
2010
IEEE
13 years 7 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
ICTAI
2008
IEEE
14 years 2 months ago
Computational Complexity of Web Service Composition Based on Behavioral Descriptions
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...
Hyunyoung Kil, Wonhong Nam, Dongwon Lee