463 search results - page 29 / 93 » The Most Reliable Subgraph Problem |
120
click to vote
DMGT
2011
14 years 5 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
117
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
130
click to vote
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
119
click to vote
SIAMIS
2010
14 years 8 months ago
2010
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
119
click to vote
CIVR
2007
Springer
15 years 8 months ago
2007
Springer
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...