Sciweavers

2597 search results - page 432 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
ORL
2000
77views more  ORL 2000»
15 years 6 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
IJRR
2002
87views more  IJRR 2002»
15 years 6 months ago
Complete Path Planning for Closed Kinematic Chains with Spherical Joints
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
Jeffrey C. Trinkle, R. James Milgram
AROBOTS
1999
87views more  AROBOTS 1999»
15 years 6 months ago
Dynamics of a Classical Conditioning Model
Abstract. Classical conditioning is a basic learning mechanism in animals and can be found in almost all organisms. If we want to construct robots with abilities matching those of ...
Christian Balkenius
CN
1999
98views more  CN 1999»
15 years 6 months ago
Mobility information for resource management in wireless ATM networks
ZUser mobility poses a significant technical challenge to network resource management in wireless ATM Asynchronous . Z .Transfer Mode networks. In order to guarantee quality of se...
Xuemin Shen, Jon W. Mark
MP
2002
103views more  MP 2002»
15 years 6 months ago
Detecting Jacobian sparsity patterns by Bayesian probing
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...
Andreas Griewank, Christo Mitev