Sciweavers

9842 search results - page 1436 / 1969
» Problem complexity
Sort
View
DAC
1995
ACM
15 years 10 months ago
Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
Yu-Liang Wu, Malgorzata Marek-Sadowska
AAAI
1996
15 years 8 months ago
Integrating Grid-Based and Topological Maps for Mobile Robot Navigation
Research on mobile robot navigation has produced two major paradigms for mapping indoorenvironments: grid-based and topological. While grid-based methods produce accurate metric m...
Sebastian Thrun, Arno Bücken
CG
2008
Springer
15 years 7 months ago
Practical global illumination for interactive particle visualization
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...
Christiaan P. Gribble, Carson Brownlee, Steven G. ...
PR
2006
119views more  PR 2006»
15 years 7 months ago
Fingerprint matching by genetic algorithms
Fingerprint matching is still a challenging problem for reliable person authentication because of the complex distortions involved in two impressions of the same finger. In this p...
Xuejun Tan, Bir Bhanu
LOGCOM
2007
91views more  LOGCOM 2007»
15 years 7 months ago
A New Modal Approach to the Logic of Intervals
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
Altaf Hussain
« Prev « First page 1436 / 1969 Last » Next »