874 search results - page 38 / 175 » Faster Algorithms for Semi-Matching Problems |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
HICSS
2003
IEEE
14 years 28 days ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
DAGSTUHL
2007
13 years 9 months ago
2007
The problem of reducing an algebraic Riccati equation XCX − AX − XD + B = 0 to a unilateral quadratic matrix equation (UQME) of the kind PX2 + QX + R = 0 is analyzed. New redu...