Sciweavers

861 search results - page 91 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
CC
2010
Springer
117views System Software» more  CC 2010»
13 years 6 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin
ASAP
2008
IEEE
120views Hardware» more  ASAP 2008»
13 years 11 months ago
Lightweight DMA management mechanisms for multiprocessors on FPGA
This paper presents a multiprocessor system on FPGA that adopts Direct Memory Access (DMA) mechanisms to move data between the external memory and the local memory of each process...
Antonino Tumeo, Matteo Monchiero, Gianluca Palermo...
ILP
2007
Springer
14 years 3 months ago
ILP : - Just Trie It
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
Rui Camacho, Nuno A. Fonseca, Ricardo Rocha, V&iac...
FOSSACS
2010
Springer
14 years 3 months ago
Reachability Analysis of Communicating Pushdown Systems
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
Alexander Heußner, Jérôme Lerou...
ICSE
2009
IEEE-ACM
14 years 9 months ago
FlexSync: An aspect-oriented approach to Java synchronization
Designers of concurrent programs are faced with many choices of synchronization mechanisms, among which clear functional trade-offs exist. Making synchronization customizable is h...
Charles Zhang