Sciweavers

357 search results - page 2 / 72
» Is Computational Complexity a Barrier to Manipulation
Sort
View
SIAMJO
2000
101views more  SIAMJO 2000»
13 years 4 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
CATS
2007
13 years 6 months ago
On The Complexity of Manipulating Elections
We study the manipulation of voting schemes, where a voter lies about their preferences in the hope of improving the election’s outcome. All voting schemes are potentially manip...
Tom Coleman, Vanessa Teague
VL
2005
IEEE
108views Visual Languages» more  VL 2005»
13 years 10 months ago
Achieving Flexibility in Direct-Manipulation Programming Environments by Relaxing the Edit-Time Grammar
Structured program editors can lower the entry barrier for beginning computer science students by preventing syntax errors. However, when editors force programs to be executable a...
Benjamin E. Birnbaum, Kenneth J. Goldman
CATS
2007
13 years 6 months ago
A Linear Time Algorithm for Pricing European Sequential Barrier Options
Financial derivatives are contracts concerning rights and obligations to engage in future transactions on some underlying financial instrument. A major concern in financial mark...
Peng Gao, Ron van der Meyden
IPPS
1998
IEEE
13 years 9 months ago
Virtual FPGAs: Some Steps Behind the Physical Barriers
Recent advances in FPGA technologies allow to configure the RAM-based FPGA devices in a reduced time as an effective support for real-time applications. The physical dimensions of ...
William Fornaciari, Vincenzo Piuri