6740 search results - page 965 / 1348 » An s -Hamiltonian Line Graph Problem |
183
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
167
click to vote
GIS
2008
ACM
15 years 8 months ago
2008
ACM
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...
198
click to vote
SIGCOMM
2010
ACM
15 years 7 months ago
2010
ACM
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
199
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Although software managers are generally good at new project estimation, their experience of scheduling rework tends to be poor. Inconsistent or incorrect effort estimation can in...
206
click to vote
CVIU
2010
15 years 7 months ago
2010
We consider the problem of estimating the relative orientation of a number of individual photocells -or pixels- that hold fixed relative positions. The photocells measure the inte...