Sciweavers

1450 search results - page 94 / 290
» On the Complexity of Hardness Amplification
Sort
View
ICCSA
2004
Springer
14 years 2 months ago
Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
Marcelo H. Cintra, Diego R. Llanos Ferraris, Bel&e...
WINE
2009
Springer
147views Economy» more  WINE 2009»
14 years 1 months ago
Computational Aspects of Multimarket Price Wars
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
Nithum Thain, Adrian Vetta
LICS
1999
IEEE
14 years 1 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis
VLDB
1997
ACM
99views Database» more  VLDB 1997»
14 years 1 months ago
Resource Scheduling in Enhanced Pay-Per-View Continuous Media Databases
The enhanced pay-per-view (EPPV) model for providing continuous-media-on-demand(CMOD) services associates with each continuous media clip a display frequency that dependson the cl...
Minos N. Garofalakis, Banu Özden, Abraham Sil...
SE
2010
13 years 10 months ago
Automated Benchmarking of Java APIs
: Performance is an extra-functional property of software systems which is often critical for achieving sufficient scalability or efficient resource utilisation. As many applicatio...
Michael Kuperberg, Fouad Omri, Ralf Reussner