1291 search results - page 142 / 259 » Computing the multiplicity structure in solving polynomial s... |
102
click to vote
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
One of the factors holding back the application of multiagent, distributed approaches to large-scale sensor interpretation and diagnosis problems is the lack of good techniques fo...
123
click to vote
AAECC
2006
Springer
15 years 1 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
155
click to vote
ICDIM
2006
IEEE
15 years 7 months ago
2006
IEEE
: Generic systems for content-based image retrieval (CBIR), such as QBIC [7] cannot be used to solve domain-specific image retrieval problems, as for example, the identification of...