Sciweavers

4488 search results - page 737 / 898
» Properties of NP-Complete Sets
Sort
View
SIAMJO
2008
66views more  SIAMJO 2008»
13 years 9 months ago
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
Zizhuo Wang, Song Zheng, Yinyu Ye, Stephen Boyd
SIGECOM
2008
ACM
127views ECommerce» more  SIGECOM 2008»
13 years 9 months ago
Posted prices vs. negotiations: an asymptotic analysis
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
Liad Blumrosen, Thomas Holenstein
RTS
2006
132views more  RTS 2006»
13 years 9 months ago
A framework for modular analysis and exploration of heterogeneous embedded systems
Abstract The increasing complexity of heterogeneous systems-on-chip, SoC, and distributed embedded systems makes system optimization and exploration a challenging task. Ideally, a ...
Arne Hamann, Marek Jersak, Kai Richter, Rolf Ernst
AICOM
2005
91views more  AICOM 2005»
13 years 9 months ago
Multiagent systems for cardiac pacing simulation and control
Abstract. Simulating and controlling physiological phenomena are complex tasks to tackle. This is due to the fact that physiological processes are usually described by a set of par...
Francesco Amigoni, Alessandro Beda, Nicola Gatti
AMC
2005
138views more  AMC 2005»
13 years 9 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa