Sciweavers

99 search results - page 2 / 20
» Fast Planning for Dynamic Preferences
Sort
View
AIPS
2007
13 years 8 months ago
A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
Julie A. Shah, John Stedl, Brian C. Williams, Paul...
IDMS
2000
Springer
128views Multimedia» more  IDMS 2000»
13 years 9 months ago
Fast and Optimal Multicast-Server Selection Based on Receivers' Preference
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
AIED
2005
Springer
13 years 11 months ago
An Agent-based Approach to Assisting Learners to Dynamically Adjust Learning Processes
This paper presents an agent-based approach to assisting learners to dynamically adjust learning processes. The online learning process is first investigated where the importance ...
Weidong Pan
KES
2006
Springer
13 years 5 months ago
A computational framework for package planning
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
Yang Xiang, Michael Janzen
AIPS
2008
13 years 8 months ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams