Sciweavers

297 search results - page 7 / 60
» On the Fastest Vickrey Algorithm
Sort
View
DATE
2009
IEEE
119views Hardware» more  DATE 2009»
14 years 2 months ago
Improved worst-case response-time calculations by upper-bound conditions
Fast real-time feasibility tests and analysis algorithms are necessary for a high acceptance of the formal techniques by industrial software engineers. This paper presents a possi...
Victor Pollex, Steffen Kollmann, Karsten Albers, F...
CORR
2002
Springer
133views Education» more  CORR 2002»
13 years 7 months ago
Sequential and Parallel Algorithms for Mixed Packing and Covering
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
Neal E. Young
TSMC
2002
102views more  TSMC 2002»
13 years 7 months ago
Generalized pursuit learning schemes: new families of continuous and discretized learning automata
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry [24]. The pioneering work of these ...
M. Agache, B. John Oommen
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
11 years 9 months ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri
ECWEB
2003
Springer
151views ECommerce» more  ECWEB 2003»
14 years 17 days ago
A Combinatorial Exchange for Autonomous Traders
Abstract. Combinatorial exchanges have attracted much attention recently. However, to this point there is no generally accepted payment allocation algorithm capable of clearing com...
Andreas Tanner, Gero Mühl