Sciweavers

1566 search results - page 213 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
IJCV
2000
161views more  IJCV 2000»
13 years 7 months ago
Probabilistic Detection and Tracking of Motion Boundaries
We propose a Bayesian framework for representing and recognizing local image motion in terms of two basic models: translational motion and motion boundaries. Motion boundaries are ...
Michael J. Black, David J. Fleet
AIPS
2008
13 years 10 months ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell
GECCO
2006
Springer
201views Optimization» more  GECCO 2006»
13 years 11 months ago
Selective self-adaptive approach to ant system for solving unit commitment problem
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
Songsak Chusanapiputt, Dulyatat Nualhong, Sujate J...
HPCC
2009
Springer
14 years 15 days ago
Load Scheduling Strategies for Parallel DNA Sequencing Applications
This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...
Sudha Gunturu, Xiaolin Li, Laurence Tianruo Yang
ICRA
2000
IEEE
117views Robotics» more  ICRA 2000»
14 years 8 days ago
Kinodynamic Motion Planning Amidst Moving Obstacles
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
Robert Kindel, David Hsu, Jean-Claude Latombe, Ste...