Sciweavers

1830 search results - page 131 / 366
» Functional Programs as Linked Data
Sort
View
143
Voted
ORL
2000
77views more  ORL 2000»
15 years 3 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
ICFEM
2010
Springer
15 years 1 months ago
Verifying Heap-Manipulating Programs with Unknown Procedure Calls
Abstract. Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available...
Shengchao Qin, Chenguang Luo, Guanhua He, Florin C...
89
Voted
SPAA
2004
ACM
15 years 8 months ago
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...
148
Voted
JSA
2000
175views more  JSA 2000»
15 years 3 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
143
Voted
SIGCSE
2002
ACM
211views Education» more  SIGCSE 2002»
15 years 3 months ago
To java.net and beyond: teaching networking concepts using the Java networking API
This paper covers the use of Java and its API for developing networking programs in an undergraduate computer networks class. Through the use of TCP and UDP sockets provided in th...
Greg Gagne