3663 search results - page 373 / 733 » Problems in the ontology of computer programs |
183
click to vote
PLDI
2004
ACM
16 years 7 days ago
2004
ACM
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...
162
click to vote
WG
2007
Springer
16 years 28 days ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
168
click to vote
CONEXT
2006
ACM
16 years 24 days ago
2006
ACM
Abstract— In many IP media services, the media channels are point-to-point, dynamic, and set up with the participation of one or more application servers, even though the media p...
170
click to vote
SAC
2003
ACM
16 years 2 days ago
2003
ACM
One of the open problems in the area of domain-specific languages is how to make domain-specific language development easier for domain experts not versed in a programming languag...
155
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...