Sciweavers

143 search results - page 8 / 29
» Timed CSP: A Retrospective
Sort
View
PKDD
2004
Springer
91views Data Mining» more  PKDD 2004»
15 years 3 months ago
Summarization of Dynamic Content in Web Collections
This paper describes a new research proposal of multi-document summarization of dynamic content in web pages. Much information is lost in the Web due to the temporal character of w...
Adam Jatowt, Mitsuru Ishizuka
COLT
2010
Springer
14 years 8 months ago
Regret Minimization With Concept Drift
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
Koby Crammer, Yishay Mansour, Eyal Even-Dar, Jenni...
SSIRI
2010
14 years 8 months ago
Modelling and Implementing Complex Systems with Timebands
—We describe how to use a timeband architecture to model real-time requirements. The architecture separates requirements that use different time units, producing a family of mode...
Jim Woodcock, Marcel Oliveira, Alan Burns, Kun Wei
FM
1999
Springer
97views Formal Methods» more  FM 1999»
15 years 2 months ago
Sensors and Actuators in TCOZ
Timed Communicating Object Z (TCOZ) combines Object-Z's strengths in modeling complex data and algorithms with Timed CSP's strengths in modeling real-time concurrency. TC...
Brendan P. Mahony, Jin Song Dong
FOCS
2007
IEEE
15 years 4 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx