1702 search results - page 53 / 341 » Using Nondeterminism to Design Efficient Deterministic Algor... |
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
ATAL
2009
Springer
13 years 8 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
ISDA
2008
IEEE
14 years 2 months ago
2008
IEEE
Due to their excellent performance in solving combinatorial optimization problems, metaheuristics algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Sea...
TCAD
2008
13 years 7 months ago
2008
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
ISMB
1996
13 years 9 months ago
1996
Weshowin this paper that manypopular models of folding and/or alignment maybe described by a new formalism: multi-tape S-attribute grammars(MTSAG's).This formalism relieves t...