2168 search results - page 126 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
133
click to vote
GECCO
2008
Springer
15 years 5 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...
128
click to vote
IJCAI
2003
15 years 5 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
139
Voted
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
In modern circuit design, it is difficult to provide reliable parametric yield prediction since the real distribution of process data is hard to measure. Most existing approaches ...
144
Voted
KDD
2001
ACM
16 years 4 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
152
Voted
SMA
1999
ACM
15 years 8 months ago
1999
ACM
We present an efficient algorithm for preserving the total volume of a solids undergoing free-form deformation using discrete level-of-detail representations. Given the boundary r...