Sciweavers

475 search results - page 11 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
NETWORKS
2010
13 years 5 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
CLUSTER
2001
IEEE
13 years 11 months ago
A Distributed Object Model for Solving Irregularly Structured Problems on Cluster
This paper presents a distributed object model MOIDE for solving irregularly structured problems on cluster. The primary appeal of MOIDE is its flexible system structure that is a...
Yudong Sun, Cho-Li Wang
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
13 years 12 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
EAAI
2007
154views more  EAAI 2007»
13 years 7 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de...
Ahlem Ben Hassine, Tu Bao Ho
ANOR
2007
151views more  ANOR 2007»
13 years 7 months ago
Distributed personnel scheduling - negotiation among scheduling agents
This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) pa...
Eliezer Kaplansky, Amnon Meisels