3038 search results - page 402 / 608 » Controlling Engineering Problem Solving |
132
Voted
SIGADA
2004
Springer
15 years 7 months ago
2004
Springer
Genetic Algorithms provide computational procedures that are modeled on natural genetic system mechanics, whereby a coded solution is “evolved” from a set of potential solutio...
110
click to vote
GLVLSI
2003
IEEE
15 years 7 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
99
Voted
ITCC
2000
IEEE
15 years 6 months ago
2000
IEEE
Parallel computers can do more than simply speed up sequential computations. They are capable of nding solutions that are far better in quality than those obtained by sequential c...
112
click to vote
ISSA
2008
15 years 3 months ago
2008
The problem today is that users are expected to remember multiple user names and passwords for different domains when accessing the Internet. Identity management solutions seek to...
119
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...