Sciweavers

5230 search results - page 948 / 1046
» Dynamic Optimality -- Almost
Sort
View
CDC
2010
IEEE
13 years 5 months ago
Synthesis using approximately bisimilar abstractions: time-optimal control problems
s using Approximately Bisimilar Abstractions: Time-Optimal Control Problems Antoine Girard In this paper, we present a hierarchical approach to time-optimal control using approxima...
Antoine Girard
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 5 months ago
Competitive and Deterministic Embeddings of Virtual Networks
Network virtualization is a paradigm that allows for flexible and efficient allocation of the resources among multiple virtual networks (VNets). In this paper we deal with the p...
Guy Even, Moti Medina, Gregor Schaffrath, Stefan S...
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 5 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 5 months ago
QoS Routing in Smart Grid
Smart grid is an emerging technology which is able to control the power load via price signaling. The communication between the power supplier and power customers is a key issue in...
Husheng Li, Weiyi Zhang
CSMR
2010
IEEE
13 years 5 months ago
A Heuristic-Based Approach to Identify Concepts in Execution Traces
Abstract--Concept or feature identification, i.e., the identification of the source code fragments implementing a particular feature, is a crucial task during software understandin...
Fatemeh Asadi, Massimiliano Di Penta, Giuliano Ant...