Sciweavers

297 search results - page 26 / 60
» On the Fastest Vickrey Algorithm
Sort
View
SIGECOM
2004
ACM
165views ECommerce» more  SIGECOM 2004»
14 years 25 days ago
Adaptive limited-supply online auctions
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Da...
QEST
2009
IEEE
14 years 2 months ago
Simulation-Based CTMC Model Checking: An Empirical Evaluation
This paper provides an experimental study of the efficiency of simulation-based model-checking algorithms for continuous-time Markov chains by comparing: MRMC – the only tool t...
Joost-Pieter Katoen, Ivan S. Zapreev
MFCS
2005
Springer
14 years 27 days ago
Online and Dynamic Recognition of Squarefree Strings
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient a...
Jesper Jansson, Zeshan Peng
IPPS
1999
IEEE
13 years 11 months ago
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
Keqin Li, Victor Y. Pan
DISCO
1993
114views Hardware» more  DISCO 1993»
13 years 11 months ago
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
Michael B. Monagan