Sciweavers

238 search results - page 41 / 48
» Planning as Satisfiability
Sort
View
CP
2007
Springer
14 years 4 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
HICSS
2003
IEEE
132views Biometrics» more  HICSS 2003»
14 years 3 months ago
Markets for Reliability and Financial Options in Electricity: Theory to Support the Practice
The underlying structure of why and how consumers value reliability of electric service is explored, together with the technological options and cost characteristics for the provi...
Timothy Mount, William Schulze, Richard E. Schuler
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 10 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
EDBT
2002
ACM
125views Database» more  EDBT 2002»
14 years 10 months ago
Estimating Answer Sizes for XML Queries
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
EDBT
2004
ACM
115views Database» more  EDBT 2004»
14 years 10 months ago
QuaSAQ: An Approach to Enabling End-to-End QoS for Multimedia Databases
Abstract. The paper discusses the design and prototype implementation of a QoS-aware multimedia database system. Recent research in multimedia databases has devoted little attentio...
Yi-Cheng Tu, Sunil Prabhakar, Ahmed K. Elmagarmid,...