2251 search results - page 141 / 451 » Specification and Implementation Problems for C |
122
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
146
Voted
AIPS
2006
15 years 5 months ago
2006
Mixed-Initiative approaches to Planning and Scheduling are being applied in different real world domains. While several recent successful examples of such tools encourage a wider ...
128
click to vote
ACTA
2010
15 years 3 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
102
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
168
Voted
FCCM
2008
IEEE
15 years 10 months ago
2008
IEEE
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...