Sciweavers

2313 search results - page 258 / 463
» On Heuristic Time Hierarchies
Sort
View
APN
2001
Springer
15 years 11 months ago
Optimising Enabling Tests and Unfoldings of Algebraic System Nets
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under whi...
Marko Mäkelä
ROBOCUP
2001
Springer
157views Robotics» more  ROBOCUP 2001»
15 years 11 months ago
Using the Electric Field Approach in the RoboCup Domain
In autonomous robotics, so-called artificial potential fields are often used to plan and control the motion of a physical robot. In this paper, we propose to use an artificial e...
Stefan J. Johansson, Alessandro Saffiotti
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
15 years 11 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann
DATE
2000
IEEE
90views Hardware» more  DATE 2000»
15 years 11 months ago
Fast Cache and Bus Power Estimation for Parameterized System-on-a-Chip Design
We present a technique for fast estimation of the power consumed by the cache and bus sub-system of a parameterized system-on-a-chip design for a given application. The technique ...
Jörg Henkel, Tony Givargis, Frank Vahid
FCCM
2000
IEEE
105views VLSI» more  FCCM 2000»
15 years 11 months ago
A Communication Scheduling Algorithm for Multi-FPGA Systems
For multiple FPGA systems, the limited number of I/O pins causes many problems. To solve these problems, efficient communication scheduling among FPGAs is crucial for obtaining hi...
Jinwoo Suh, Dong-In Kang, Stephen P. Crago