Sciweavers

3320 search results - page 280 / 664
» Heuristics for the Phylogeny Problem
Sort
View
ICDCS
1992
IEEE
15 years 11 months ago
End-to-End Scheduling to Meet Deadlines in Distributed Systems
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
Riccardo Bettati, Jane W.-S. Liu
VL
1995
IEEE
121views Visual Languages» more  VL 1995»
15 years 10 months ago
Buffering of Intermediate Results in Dataflow Diagrams
Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. ...
Allison Woodruff, Michael Stonebraker
AIPS
2008
15 years 9 months ago
Effective Information Value Calculation for Interruption Management in Multi-Agent Scheduling
This paper addresses the problem of deciding effectively whether to interrupt a teammate who may have information that is valuable for solving a collaborative scheduling problem. ...
David Sarne, Barbara J. Grosz, Peter Owotoki
ATAL
2008
Springer
15 years 8 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun
CPAIOR
2008
Springer
15 years 8 months ago
Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
Ivan Heckman, J. Christopher Beck