Sciweavers

2745 search results - page 545 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
98
Voted
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
15 years 3 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
PLDI
1997
ACM
15 years 3 months ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen
POPL
1989
ACM
15 years 3 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
ATAL
2008
Springer
15 years 1 months ago
Adaptive multi-robot wide-area exploration and mapping
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
RSS
2007
119views Robotics» more  RSS 2007»
15 years 1 months ago
Emergent Task Allocation for Mobile Robots
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...
Nuzhet Atay, O. Burçhan Bayazit