5100 search results - page 903 / 1020 » The Linear Complexity of a Graph |
127
click to vote
DCG
1998
15 years 4 months ago
1998
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
152
click to vote
DEDS
1998
15 years 4 months ago
1998
In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in de...
139
click to vote
INFORMATICALT
1998
15 years 4 months ago
1998
Abstract. We study invertibility of big n × n matrices. There exists a number of algorithms, especially in mathematical statistics and numerical mathematics, requiring to invert s...
142
click to vote
ML
2002
ACM
15 years 4 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
121
click to vote
MP
2002
15 years 4 months ago
2002
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...