4110 search results - page 42 / 822 » Efficient algorithms for the 2-gathering problem |
119
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
120
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. The ...
136
Voted
AUSDM
2008
Springer
15 years 5 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
86
Voted
CSDA
2006
15 years 3 months ago
2006
Huber's M-estimation technique is applied to a block-angular regression problem, which may arise from some applications. A recursive, modified Newton approach to computing th...
107
Voted
DAC
2010
ACM
15 years 7 months ago
2010
ACM
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...