Sciweavers

6300 search results - page 87 / 1260
» We have it easy, but do we have it right
Sort
View
NIPS
1993
15 years 2 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson
PR
2008
100views more  PR 2008»
15 years 1 months ago
Boundary based shape orientation
The computation of a shape's orientation is a common task in the area of computer vision and image processing, being used for example to define a local frame of reference and...
Jovisa D. Zunic, Milos Stojmenovic
APN
2005
Springer
15 years 6 months ago
The ProM Framework: A New Era in Process Mining Tool Support
Under the umbrella of buzzwords such as “Business Activity Monitoring” (BAM) and “Business Process Intelligence” (BPI) both academic (e.g., EMiT, Little Thumb, InWoLvE, Pro...
Boudewijn F. van Dongen, Ana Karla A. de Medeiros,...
MONET
2007
160views more  MONET 2007»
15 years 23 days ago
Joint Design of Routing and Medium Access Control for Hybrid Mobile Ad Hoc Networks
Efficient routing and medium access control (MAC) are very important for Mobile Ad hoc Networks (MANETs). Most existing routing and MAC protocols consider homogeneous ad hoc networ...
Xiaojiang Du, Dapeng Wu
AAAI
2007
15 years 3 months ago
Finding Related Pages Using Green Measures: An Illustration with Wikipedia
We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool. It is generic, ...
Yann Ollivier, Pierre Senellart