Sciweavers

2430 search results - page 296 / 486
» Computing Tutte Polynomials
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 8 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
ATAL
2001
Springer
15 years 8 months ago
A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented Domains
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
María-Victoria Belmonte, Ricardo Conejo, Jo...
ESA
2001
Springer
61views Algorithms» more  ESA 2001»
15 years 8 months ago
A Separation Bound for Real Algebraic Expressions
Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k-th root operations for int...
Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, S...
FC
2001
Springer
125views Cryptology» more  FC 2001»
15 years 8 months ago
(M+1)st-Price Auction Protocol
Abstract. This paper presents a new protocol for M + 1st-price auction, a style of auction in which the highest M bidders win and pay a uniform price, determined by the (M + 1)st p...
Hiroaki Kikuchi
ASAP
2000
IEEE
121views Hardware» more  ASAP 2000»
15 years 8 months ago
A Hardware Algorithm for Variable-Precision Logarithm
This paper presents an e cient hardware algorithm for variable-precision logarithm. The algorithm uses an iterative te chnique that employs table lookups and polynomial approximat...
Javier Hormigo, Julio Villalba, Michael J. Schulte