1466 search results - page 166 / 294 » Complexity of Reasoning over Temporal Data Models |
145
click to vote
CSL
1999
Springer
15 years 8 months ago
1999
Springer
This paper describes a new data structure, difference decision diagrams (DDDs), for representing a Boolean logic over inequalities of the form ¡£¢¥¤§¦©¨ and ¡¢¥¤...
143
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
Cyber-physical systems (CPS) are becoming ubiquitous. Almost every device today has a controller that reads inputs through sensors, does some processing and then performs actions t...
187
click to vote
JMLR
2012
13 years 7 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
172
click to vote
JAPLL
2010
15 years 2 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
175
click to vote
ASIAMS
2008
IEEE
15 years 6 months ago
2008
IEEE
The paper elaborates upon the interim results achieved in resolving a few newly discovered 16th century letters now alleged to be written by Queen Mary of Scots (QMS). Despite the...