387 search results - page 67 / 78 » Reasoning About Approximate Match Query Results |
SIGSOFT
2006
ACM
14 years 9 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
AGP
1996
IEEE
14 years 23 days ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
ATAL
2006
Springer
14 years 10 days ago
2006
Springer
This paper presents a statistical learning approach to predicting people's bidding behavior in negotiation. Our study consists of multiple 2-player negotiation scenarios wher...
IPL
2008
13 years 8 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
EDBT
1990
ACM
14 years 20 days ago
1990
ACM
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...