5022 search results - page 262 / 1005 » Data structures and problem solving using Java |
137
click to vote
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
—Correlation clustering problem is a NP hard problem and technologies for the solving of correlation clustering problem can be used to cluster given data set with relation matrix...
122
Voted
GG
2004
Springer
15 years 8 months ago
2004
Springer
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...
149
Voted
ICCAD
2001
IEEE
15 years 11 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
114
Voted
SDM
2007
SIAM
15 years 4 months ago
2007
SIAM
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...
89
Voted
ICCSA
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we present a nonlinear programming solution to one of the most challenging problems in trajectory optimization. Unlike most aerospace trajectory optimization problems...