Sciweavers

17366 search results - page 3045 / 3474
» New Revision Algorithms
Sort
View
CORR
1998
Springer
135views Education» more  CORR 1998»
15 years 6 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
ALGORITHMICA
1999
84views more  ALGORITHMICA 1999»
15 years 6 months ago
Computational Approaches to Drug Design
Abstract. The rational approach to pharmaceutical drug design begins with an investigation of the relationship between chemical structure and biological activity. Information gaine...
Paul W. Finn, Lydia E. Kavraki
INFORMATICALT
2002
91views more  INFORMATICALT 2002»
15 years 6 months ago
Bayesian Heuristic Approach to Scheduling
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
Jonas Mockus
DCG
1998
53views more  DCG 1998»
15 years 6 months ago
Motion Planning in Environments with Low Obstacle Density
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...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
INTR
2002
50views more  INTR 2002»
15 years 6 months ago
Methodologies for crawler based Web surveys
There have been many attempts to study the content of the web, either through human or automatic agents. Five different previously used web survey methodologies are described and ...
Mike Thelwall
« Prev « First page 3045 / 3474 Last » Next »