4103 search results - page 235 / 821 » Some results on the Collatz problem |
230
click to vote
CVPR
2008
IEEE
15 years 6 months ago
2008
IEEE
Learning a robust projection with a small number of training samples is still a challenging problem in face recognition, especially when the unseen faces have extreme variation in...
172
click to vote
EOR
2008
15 years 6 months ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
154
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Electronic design automation is a field replete with challenging ? and often intractable ? problems to be solved over very large instances. As a result, the field of design automa...
177
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). Such a service has the potential to simplif...
162
click to vote
ESA
2007
Springer
16 years 27 days ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...