Sciweavers

475 search results - page 2 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
CCIA
2008
Springer
13 years 7 months ago
Privacy in Distributed Meeting Scheduling
Meetings are an important vehicle for human interaction. The Meeting Scheduling problem (MS) considers several agents, each holding a personal calendar, and a number of meetings wh...
Ismel Brito, Pedro Meseguer
ICPPW
2009
IEEE
13 years 3 months ago
Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
Liliana Cucu-Grosjean, Olivier Buffet
ISORC
2008
IEEE
13 years 12 months ago
Compositional Feasibility Analysis of Conditional Real-Time Task Models
Conditional real-time task models, which are generalizations of periodic, sporadic, and multi-frame tasks, represent real world applications more accurately. These models can be c...
Madhukar Anand, Arvind Easwaran, Sebastian Fischme...
AAAI
1994
13 years 6 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
AAAI
2000
13 years 6 months ago
RealPlan: Decoupling Causal and Resource Reasoning in Planning
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
Biplav Srivastava