Sciweavers

577 search results - page 92 / 116
» Budget Feasible Mechanisms
Sort
View
JCST
2008
134views more  JCST 2008»
14 years 11 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li
JSAC
2006
93views more  JSAC 2006»
14 years 11 months ago
A future radio-access framework
This paper discusses the requirements on future radio access and, based on the requirements, proposes a framework for such a system. The proposed system based on orthogonal frequen...
David Astely, Erik Dahlman, Pål K. Frenger, ...
TDSC
2008
125views more  TDSC 2008»
14 years 11 months ago
Trustworthy Computing under Resource Constraints with the DOWN Policy
Trustworthy computing modules like secure coprocessors (ScP) are already in extensive use today, albeit limited predominantly to scenarios where constraints on cost is not a seriou...
Mahalingam Ramkumar
TIFS
2008
109views more  TIFS 2008»
14 years 11 months ago
Lookup-Table-Based Secure Client-Side Embedding for Spread-Spectrum Watermarks
Today, mass-scale electronic content distribution systems embed forensic tracking watermarks primarily at the distribution server. For limiting the bandwidth usage and server compl...
Mehmet Utku Celik, Aweke N. Lemma, Stefan Katzenbe...
MANSCI
2007
139views more  MANSCI 2007»
14 years 11 months ago
A Market-Based Optimization Algorithm for Distributed Systems
In this paper, a market-based decomposition method for decomposable linear systems is developed. The solution process iterates between a master problem that solves the market-matc...
Zhiling Guo, Gary J. Koehler, Andrew B. Whinston