Sciweavers

3663 search results - page 171 / 733
» Problems in the ontology of computer programs
Sort
View
IPPS
1998
IEEE
15 years 10 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
ETD2000
1995
15 years 10 months ago
Automatic generation of a neural network architecture using evolutionary computation
This paper reports the application of evolutionary computation in the automatic generation of a neural network architecture.It is a usual practice to use trial and error to find a...
E. Vonk, Lakhmi C. Jain, L. P. J. Veelenturf, R. J...
DATE
2009
IEEE
115views Hardware» more  DATE 2009»
16 years 1 months ago
Toward a runtime system for reconfigurable computers: A virtualization approach
—In this paper we propose a virtualization layer to handle the program execution on reconfigurable computers in order to address one of their biggest problems which is the manage...
Mojtaba Sabeghi, Koen Bertels
ICRA
2008
IEEE
164views Robotics» more  ICRA 2008»
16 years 29 days ago
Central axis approach for computing n-finger force-closure grasps
— In this paper, we propose a new approach for computing force-closure grasps of two-dimensional and threedimensional objects. Assuming n hard-finger contact with Coulomb fricti...
Belkacem Bounab, Daniel Sidobre, Abdelouhab Zaatri
CORR
2007
Springer
127views Education» more  CORR 2007»
15 years 6 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata