Sciweavers

281 search results - page 27 / 57
» heuristics 2000
Sort
View
COMPGEOM
2000
ACM
14 years 2 months ago
Computing approximate shortest paths on convex polytopes
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
CVPR
2000
IEEE
14 years 11 months ago
Improved Motion Stereo Matching Based on a Modified Dynamic Programming
A new method for computing precise depth map estimates of 3D shape of a moving object is proposed. 3D shape recovery in motion stereo is formulated as a matching optimization prob...
Mikhail Mozerov, Vitaly Kober, Tae-Sun Choi
ICML
2000
IEEE
14 years 10 months ago
Learning Probabilistic Models for Decision-Theoretic Navigation of Mobile Robots
Decision-theoretic reasoning and planning algorithms are increasingly being used for mobile robot navigation, due to the signi cant uncertainty accompanying the robots' perce...
Daniel Nikovski, Illah R. Nourbakhsh
BMAS
2000
IEEE
14 years 2 months ago
High-Level Design Case of a Switched-Capacitor Low-Pass Filter Using Verilog-A
System design requires experienced designers that use heuristics and built up knowledge to propose a high order solution. Behavioral models can help to formalise, optimise and spe...
Erik Lauwers, Georges G. E. Gielen, Koen Lampaert,...
FCCM
2000
IEEE
105views VLSI» more  FCCM 2000»
14 years 2 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