Sciweavers

744 search results - page 59 / 149
» Special issue on e-maintenance
Sort
View
PUK
2000
15 years 7 months ago
An Accessibility graph learning approach for task planning in large domains
Abstract. In the stream of research that aims to speed up practical planners, we propose a new approach to task planning based on Probabilistic Roadmap Methods (PRM). Our contribut...
Emmanuel Guere, Rachid Alami
DAGSTUHL
1996
15 years 7 months ago
A Comparative Revisitation of Some Program Transformation Techniques
We revisit the main techniques of program transformation which are used in partial evaluation, mixed computation, supercompilation, generalized partial computation, rule-based prog...
Alberto Pettorossi, Maurizio Proietti
ESA
2010
Springer
220views Algorithms» more  ESA 2010»
15 years 7 months ago
Data Structures for Storing Small Sets in the Bitprobe Model
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...
CN
2008
86views more  CN 2008»
15 years 6 months ago
Enhanced bulk scheduling for supporting delay sensitive streaming applications
Providing end-to-end delay guarantees for delay sensitive applications is an important packet scheduling issue with routers. In this paper, to support end-to-end delay requirement...
Yung-Cheng Tu, Meng Chang Chen, Yeali S. Sun, Wei ...
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 6 months ago
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
Gábor Ivanyos, Marek Karpinski, Lajos R&oac...