4438 search results - page 418 / 888 » The Case for Collaborative Programming |
285
click to vote
ISOLA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
187
click to vote
ICCS
2009
Springer
15 years 4 months ago
2009
Springer
Distributed parallel applications often run for hours or even days before arriving to a result. In the case of such long-running programs, the initial requirements could change aft...
226
click to vote
ICALP
1998
Springer
15 years 11 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
277
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
168
click to vote
ICFP
2005
ACM
16 years 7 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...