Sciweavers

2194 search results - page 326 / 439
» Improving HLRTA*( k )
Sort
View
91
Voted
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
15 years 6 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 6 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
COLT
2005
Springer
15 years 6 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
15 years 6 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
119
Voted
SIGCSE
2010
ACM
219views Education» more  SIGCSE 2010»
15 years 6 months ago
The design of an online environment to support pedagogical code reviews
Inspired by the formal code inspection process commonly used in the software industry, we have been exploring the use of pedagogical code reviews (PCRs), in which a team of three ...
Christopher D. Hundhausen, Anukrati Agrawal, Kyle ...