2519 search results - page 349 / 504 » Reasoning with Textual Cases |
153
click to vote
SIGSOFT
2009
ACM
16 years 7 months ago
2009
ACM
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
280
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
177
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
Jens Gerken HCI Group, University of Konstanz Box D-73 78457 Konstanz, Germany jens.gerken@uni-konstanz.de Hans-Joachim Bieg HCI Group, University of Konstanz Box D-73 78457 Konsta...
211
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
198
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...