2335 search results - page 371 / 467 » Functional Differentiation of Computer Programs |
117
click to vote
FOSSACS
2010
Springer
15 years 9 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
138
Voted
ISQED
2005
IEEE
15 years 8 months ago
2005
IEEE
As technology continues to scale beyond 100nm, there is a significant increase in performance uncertainty of CMOS logic due to process and environmental variations. Traditional c...
122
click to vote
APLAS
2005
ACM
15 years 8 months ago
2005
ACM
Many situations can be modeled as solutions of systems of simultaneous equations. If the functions of these equations monotonically increase in all bound variables, then the existe...
111
click to vote
SENSYS
2005
ACM
15 years 8 months ago
2005
ACM
We consider configuration of wireless sensor networks, where certain functions must be automatically assigned to sensor nodes, such that the properties of a sensor node (e.g., rem...
102
Voted
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...