Sciweavers

420 search results - page 44 / 84
» Some Algorithmic Problems in Polytope Theory
Sort
View
CATA
2010
14 years 11 months ago
Mixed-criticality Scheduling: Improved Resource-augmentation Results
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different c...
Sanjoy K. Baruah, Haohan Li, Leen Stougie
ICRA
2002
IEEE
141views Robotics» more  ICRA 2002»
15 years 2 months ago
Pseudoinverse Trajectory Control of Redundant Manipulators: A Fractional Calculus Perspective
Abstract— Redundant manipulators have some advantages when compared with classical arms because they allow the trajectory optimization, both on the free space and on the presence...
Fernando B. M. Duarte, José António ...
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
14 years 10 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe
ATAL
2006
Springer
15 years 1 months ago
Decentralized planning under uncertainty for teams of communicating agents
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos A....
FOCS
2006
IEEE
15 years 3 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau