1984 search results - page 195 / 397 » The colourful feasibility problem |
142
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
168
click to vote
DSD
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper1 addresses the hardware implementation of a dynamic scheduler for non-manifest data dependent periodic loops. Static scheduling techniques which are known to give near ...
168
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
Mobile robot localization from large-scale appearance mosaics has been showing increasing promise as a low-cost, high-performance and infrastructure-free solution to vehicle guida...
170
click to vote
WACV
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper a range synthesis algorithm is proposed as an initial solution to the problem of 3D environment modeling from sparse data. We develop a statistical learning method f...
150
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Automatic design of software architecture by use of genetic algorithms has already been shown to be feasible. A natural problem is to augment – if not replace – genetic algori...