Sciweavers

2194 search results - page 50 / 439
» Improving HLRTA*( k )
Sort
View
CORR
2011
Springer
146views Education» more  CORR 2011»
13 years 6 months ago
Refined bounds on the number of connected components of sign conditions on a variety
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...
Sal Barone, Saugata Basu
SSS
2010
Springer
128views Control Systems» more  SSS 2010»
13 years 9 months ago
On Transactional Scheduling in Distributed Transactional Memory Systems
We present a distributed transactional memory (TM) scheduler called Bi-interval that optimizes the execution order of transactional operations to minimize conflicts. Bi-interval c...
Junwhan Kim, Binoy Ravindran
PAKDD
2000
ACM
161views Data Mining» more  PAKDD 2000»
14 years 2 months ago
Adaptive Boosting for Spatial Functions with Unstable Driving Attributes
Combining multiple global models (e.g. back-propagation based neural networks) is an effective technique for improving classification accuracy by reducing a variance through manipu...
Aleksandar Lazarevic, Tim Fiez, Zoran Obradovic
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 11 months ago
Sequential item pricing for unlimited supply
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
Maria-Florina Balcan, Florin Constantin
IWPEC
2009
Springer
14 years 5 months ago
Improved Induced Matchings in Sparse Graphs
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Wal...