Sciweavers

388 search results - page 27 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
IJVR
2008
125views more  IJVR 2008»
13 years 8 months ago
The Virtual Instructor Intervention: A Case in LEGO Robotics
Solving robotic exercises is a difficult task for students because the modeling activity involved requires students to comprehend programming, robotic design concepts as well as ba...
Pauline H. Mosley, Jayfus T. Doswell
ATAL
2010
Springer
13 years 10 months ago
Distributed coordination of mobile agent teams: the advantage of planning ahead
We consider the problem of coordinating a team of agents engaged in executing a set of inter-dependent, geographically dispersed tasks in an oversubscribed and uncertain environme...
Laura Barbulescu, Zachary B. Rubinstein, Stephen F...
ICCSA
2004
Springer
14 years 2 months ago
Packing: Scheduling, Embedding, and Approximating Metrics
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
Hu Zhang
CN
2008
106views more  CN 2008»
13 years 7 months ago
Optimization models and methods for planning wireless mesh networks
In this paper novel optimization models are proposed for planning Wireless Mesh Networks (WMNs), where the objective is to minimize the network installation cost while providing f...
Edoardo Amaldi, Antonio Capone, Matteo Cesana, Ila...
IPPS
2007
IEEE
14 years 3 months ago
Message Routing and Scheduling in Optical Multistage Networks using Bayesian Inference method on AI algorithms
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...
Ajay K. Katangur, Somasheker Akkaladevi