14165 search results - page 387 / 2833 » The generalized two-server problem |
170
click to vote
ECML
1991
Springer
15 years 10 months ago
1991
Springer
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
172
click to vote
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
172
click to vote
ARSCOM
2007
15 years 6 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
166
click to vote
ICRA
2005
IEEE
16 years 11 days ago
2005
IEEE
- The two dominant forms of SLAM are based on Extended Kalman Filtering and Consistent Pose Estimation. We show that these are particular subsets of a more general view of the SLAM...
158
click to vote
PPAM
2005
Springer
16 years 8 days ago
2005
Springer
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...