Sciweavers

958 search results - page 52 / 192
» Resolving the Micropayment Problem
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Smoothed Analysis of Multiobjective Optimization
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
Heiko Röglin, Shang-Hua Teng
MFCS
2007
Springer
15 years 4 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
15 years 3 months ago
Tight Bounds for String Reconstruction Using Substring Queries
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
Dekel Tsur
ISSAC
2004
Springer
91views Mathematics» more  ISSAC 2004»
15 years 3 months ago
A poly-algorithmic approach to simplifying elementary functions
Simplification has been long recognised to be a fundamental problem within computer algebra[17]. However, even for the class of elementary functions, it has not been resolved in ...
James C. Beaumont, Russell J. Bradford, James H. D...
HICSS
2003
IEEE
90views Biometrics» more  HICSS 2003»
15 years 3 months ago
An Individual View on Cooperation Networks
Networks utilizing modern communication technologies can offer competitive advantages to those using them wisely. But due to the existence of network effects, planning and operati...
Tim Weitzel, Daniel Beimborn, Wolfgang König