Sciweavers

1289 search results - page 152 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
FC
2009
Springer
118views Cryptology» more  FC 2009»
15 years 4 months ago
Cryptographic Combinatorial Clock-Proxy Auctions
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
David C. Parkes, Michael O. Rabin, Christopher Tho...
ICASSP
2008
IEEE
15 years 4 months ago
Minimum variance multiplexing of multimedia objects
This paper addresses the problem of simultaneous transmission of multiple multimedia objects (such as images or video sequences) over a bandwidth-limited channel. The trivial stra...
Giuseppe Valenzise, Marco Tagliasacchi, Stefano Tu...
ICCCN
2007
IEEE
15 years 4 months ago
Large-Scale QoS-Aware Service-Oriented Networking with a Clustering-Based Approach
—Motivated by the fact that most of the existing QoS service composition solutions have limited scalability, we develop a hierarchical-based solution framework to achieve scalabi...
Jingwen Jin, Jin Liang, Jingyi Jin, Klara Nahrsted...
DATE
2005
IEEE
109views Hardware» more  DATE 2005»
15 years 3 months ago
ISEGEN: Generation of High-Quality Instruction Set Extensions by Iterative Improvement
Customization of processor architectures through Instruction Set Extensions (ISEs) is an effective way to meet the growing performance demands of embedded applications. A high-qua...
Partha Biswas, Sudarshan Banerjee, Nikil D. Dutt, ...
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 3 months ago
Genetic algorithms for the sailor assignment problem
This paper examines a real-world application of genetic algorithms – solving the United States Navy’s Sailor Assignment Problem (SAP). The SAP is a complex assignment problem ...
Deon Garrett, Joseph Vannucci, Rodrigo Silva, Dipa...