Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Robert N. Moll"'
Publikováno v:
FIE
We created an Eclipse plug-in called FrenchPress that offers students feedback on their Java programming style. It is designed not for novices but for students taking their second or third Java course. Advanced beginner students know enough to produc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82af099c0ea884682ef779c9e3d81b31
https://doi.org/10.1109/fie.2016.7757728
https://doi.org/10.1109/fie.2016.7757728
The study of formal languages and of related families of automata has long been at the core of theoretical computer science. Until recently, the main reasons for this centrality were connected with the specification and analy sis of programming lan
Computability theory is at the heart of theoretical computer science. Yet, ironically, many of its basic results were discovered by mathematical logicians prior to the development of the first stored-program computer. As a result, many texts on compu
Autor:
Patrick Healy, Robert N. Moll
Publikováno v:
Journal of the Operational Research Society. 47:523-537
In this paper we apply a family of heuristics to solve the rectangle layout problem. Our principal technique, however, is a variant of local optimization. This technique, which we call sacrificing, differs from the traditional local optimization algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::124487f0f26a31cc5e1fc254624b8cd2
https://doi.org/10.1057/jors.1996.58
https://doi.org/10.1057/jors.1996.58
Autor:
Ugo Buy, Robert N. Moll
Publikováno v:
Automated Software Engineering. 2:265-309
The behavior of a concurrent program often depends on the arbitrary interleaving of computations performed by asynchronous processes. The resulting non-determinism can lead to such phenomena as deadlock and starvation, making program development extr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4334136d806fd5c691e932c35731c86c
https://doi.org/10.1007/bf00871802
https://doi.org/10.1007/bf00871802
Autor:
Robert N. Moll, Patrick Healy
Publikováno v:
European Journal of Operational Research. 83:83-104
In this paper we propose a cheap yet effective extension to the traditional local improvement algorithm. We present this extension in the context of the Dial-A-Ride Problem, a variant of the Traveling Salesman Problem. This extension, which we call s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf2b776bf81589a497dc6684719c8004
https://doi.org/10.1016/0377-2217(93)e0292-6
https://doi.org/10.1016/0377-2217(93)e0292-6
Publikováno v:
European Journal of Operational Research. 68:400-412
The two-dimensional guillotine cutting stock problem seeks to apply a sequence of guillotine (edge to edge) cuts to extract a collection of smaller rectangles from a stock piece. In this paper an O(n3) approximation algorithm for the two-dimensional
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0500de8328f6f8fb4a56030873619f75
https://doi.org/10.1016/0377-2217(93)90196-t
https://doi.org/10.1016/0377-2217(93)90196-t
Autor:
Robert N. Moll, Ugo Buy
Publikováno v:
Lecture Notes in Computer Science ISBN: 3540544771
CAV
CAV
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2a093e8251f9fa3caa157e5ef585c98
https://doi.org/10.1007/bfb0023743
https://doi.org/10.1007/bfb0023743
Autor:
Robert N. Moll, Mahesh Girkar
Publikováno v:
CONCUR '94: Concurrency Theory ISBN: 9783540583295
CONCUR
CONCUR
In this paper we extend some of the results presented by German and Sistla in [4]. Their framework for concurrent systems, at a certain level of abstraction, is suitable for modeling a number of resource-oriented problems in concurrency in which ther
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd2c57f70820319382355115ec827f89
https://doi.org/10.1007/978-3-540-48654-1_7
https://doi.org/10.1007/978-3-540-48654-1_7
Autor:
Mahesh Girkar, Robert N. Moll
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783540571636
FCT
FCT
In this paper we analyze a particular sequence of points in the poset of nonnegative lattice points in n-dimensions. For this sequence, in 2-dimensions, we obtain optimal upper bounds on the number of points to be selected in order to ensure desired
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47b500c0a8b741a4a72c96e989bd9ee6
https://doi.org/10.1007/3-540-57163-9_21
https://doi.org/10.1007/3-540-57163-9_21