Sciweavers

3223 search results - page 33 / 645
» The Scaling of Search Cost
Sort
View
CP
2007
Springer
14 years 2 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
ICDE
2005
IEEE
122views Database» more  ICDE 2005»
14 years 1 months ago
A Cost-Space Approach to Distributed Query Optimization in Stream Based Overlays
Abstract— Distributed stream-based applications, such as continuous query systems, have network scale and time characteristics that challenge traditional distributed query optimi...
Jeffrey Shneidman, Peter R. Pietzuch, Matt Welsh, ...
JCM
2006
86views more  JCM 2006»
13 years 8 months ago
MAC Layer RFID Protocol for Low Cost Object Identification
In this paper, we introduce a novel medium access control (MAC) protocol for Radio Frequency Identification (RFID) systems. This protocol exploits the Markov Chain Model of Slotted...
Shweta Singh
NIPS
2004
13 years 9 months ago
A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
Daniela Pucci de Farias, Benjamin Van Roy
HPCA
2005
IEEE
14 years 8 months ago
A New Scalable and Cost-Effective Congestion Management Strategy for Lossless Multistage Interconnection Networks
In this paper, we propose a new congestion management strategy for lossless multistage interconnection networks that scales as network size and/or link bandwidth increase. Instead...
Finbar Naven, Ian Johnson, José Duato, Jose...