Sciweavers

1576 search results - page 152 / 316
» Properties of Synthetic Optimization Problems
Sort
View
PPSN
2010
Springer
15 years 2 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
15 years 10 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
STOC
2010
ACM
194views Algorithms» more  STOC 2010»
15 years 9 months ago
Multi-parameter mechanism design and sequential posted pricing
We study the classic mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-inte...
Shuchi Chawla, Jason Hartline, David Malec and Bal...
ICDCS
2009
IEEE
15 years 11 months ago
Stochastic Multicast with Network Coding
The usage of network resources by content providers is commonly governed by Service Level Agreements (SLA) between the content provider and the network service provider. Resource ...
Ajay Gopinathan, Zongpeng Li
SEMWEB
2005
Springer
15 years 10 months ago
Rapid Benchmarking for Semantic Web Knowledge Base Systems
Abstract. We present a method for rapid development of benchmarks for Semantic Web knowledge base systems. At the core, we have a synthetic data generation approach for OWL that is...
Sui-Yu Wang, Yuanbo Guo, Abir Qasem, Jeff Heflin