Sciweavers

283 search results - page 56 / 57
» Abstracting Reusable Cases from Reinforcement Learning
Sort
View
ER
2007
Springer
146views Database» more  ER 2007»
14 years 1 months ago
Achieving, Satisficing, and Excelling
Abstract. Definitions of the concepts derived from the goal concept (including functional and nonfunctional goal, hardgoal, and softgoal) used in requirements engineering are discu...
Ivan Jureta, Stéphane Faulkner, Pierre-Yves...
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
14 years 1 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
14 years 11 months ago
Stop Chasing Trends: Discovering High Order Models in Evolving Data
Abstract-- Many applications are driven by evolving data -patterns in web traffic, program execution traces, network event logs, etc., are often non-stationary. Building prediction...
Shixi Chen, Haixun Wang, Shuigeng Zhou, Philip S. ...
SAT
2009
Springer
117views Hardware» more  SAT 2009»
14 years 4 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
14 years 6 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...