Sciweavers

19320 search results - page 3527 / 3864
» On the complexity of computing determinants
Sort
View
RAS
1998
145views more  RAS 1998»
15 years 6 months ago
Coordinated path planning for multiple robots
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
Petr Svestka, Mark H. Overmars
RE
2002
Springer
15 years 6 months ago
Relating Software Requirements and Architectures Using Problem Frames
Problem frames provide a means of analyzing and decomposing problems. They emphasise the world outside of the computer, helping the developer to focus on the problem domain, inste...
Jon G. Hall, Michael Jackson, Robin C. Laney, Bash...
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
15 years 6 months ago
Workflow management with service quality guarantees
Workflow management systems (WFMS) that are geared for the orchestration of business processes across multiple organizations are complex distributed systems: they consist of multi...
Michael Gillmann, Gerhard Weikum, Wolfgang Wonner
SP
2002
IEEE
129views Security Privacy» more  SP 2002»
15 years 6 months ago
The XCAT Science Portal
The design and prototype implementation of the XCAT Grid Science Portal is described in this paper. The portal lets grid application programmers easily script complex distributed ...
Sriram Krishnan, Randall Bramley, Dennis Gannon, R...
TASLP
2002
84views more  TASLP 2002»
15 years 6 months ago
Maximum likelihood multiple subspace projections for hidden Markov models
The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some compl...
Mark J. F. Gales
« Prev « First page 3527 / 3864 Last » Next »