Sciweavers

3528 search results - page 108 / 706
» A New Approach to Planning in Networks
Sort
View
IJCAI
1989
14 years 11 months ago
A Planning/Scheduling Methodology for the Constrained Resource Problem
This paper presents a new planning/scheduling methodology for the constrained resource problem (CRP), in which the amount of available resources is limited and usually monotonical...
Naiping Keng, David Y. Y. Yun
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
14 years 7 months ago
Global reachability and path planning for planetary exploration with montgolfiere balloons
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
Lars Blackmore, Yoshiaki Kuwata, Michael T. Wolf, ...
AAAI
2012
13 years 9 days ago
Planning in Factored Action Spaces with Symbolic Dynamic Programming
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
Aswin Raghavan, Saket Joshi, Alan Fern, Prasad Tad...
SIGCSE
1997
ACM
111views Education» more  SIGCSE 1997»
15 years 2 months ago
Teaching an engineering approach for network computing
Parallelism and concurrency have long been considered as non essential during the cursus of the average programmer. However, thanks to technological advances, new promising forms ...
Eric Dillon, Carlos Gamboa Dos Santos, Jacques Guy...
ACS
2004
14 years 9 months ago
A Categorical Approach to Threshold Agent Networks
Threshold agent networks (TANs) constitute a discretized modification of threshold (also known as neural) networks that are appropriate for modeling computer simulations. In this p...
George Voutsadakis