14165 search results - page 393 / 2833 » The generalized two-server problem |
147
click to vote
DLOG
1996
15 years 8 months ago
1996
Several significant problems exist whenapplying knowledge representation systems to real problems. In particular, the obscurity of LISP, the resource consumption, garbage collecti...
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
159
click to vote
DM
2008
15 years 6 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
129
click to vote
NPL
2008
15 years 6 months ago
2008
In this paper, the problem of residual variance estimation is examined. The problem is analyzed in a general setting which covers non-additive heteroscedastic noise under non-iid s...
219
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...