Sciweavers

14548 search results - page 2608 / 2910
» The Optimal Path-Matching Problem
Sort
View
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
16 years 1 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
16 years 1 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
16 years 1 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
FM
2009
Springer
124views Formal Methods» more  FM 2009»
16 years 1 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
16 years 1 months ago
Environmental robustness in multi-agent teams
Evolution has proven to be an effective method of training heterogeneous multi-agent teams of autonomous agents to explore unknown environments. Autonomous, heterogeneous agents ...
Terence Soule, Robert B. Heckendorn
« Prev « First page 2608 / 2910 Last » Next »