Sciweavers

1768 search results - page 254 / 354
» Optimal routing in Chord
Sort
View
ASPDAC
2005
ACM
92views Hardware» more  ASPDAC 2005»
15 years 3 months ago
An LP-based methodology for improved timing-driven placement
— A method for timing driven placement is presented. The core of the approach is optimal timing-driven relaxed placement based on a linear programming (LP) formulation. The formu...
Qingzhou (Ben) Wang, John Lillis, Shubhankar Sanya...
ICAI
2004
15 years 3 months ago
Action Inhibition
An explicit exploration strategy is necessary in reinforcement learning (RL) to balance the need to reduce the uncertainty associated with the expected outcome of an action and the...
Myriam Abramson
100
Voted
JSAC
2008
82views more  JSAC 2008»
15 years 1 months ago
Integration of communication and control using discrete time Kuramoto models for multivehicle coordination over broadcast networ
Abstract-- This paper considers the integration of communication and control with respect to the task of coordinated heading control for a group of N vehicles. The heading control ...
Daniel J. Klein, Phillip Lee, Kristi A. Morgansen,...
PE
2007
Springer
112views Optimization» more  PE 2007»
15 years 1 months ago
Performance bounds for feedforward queueing networks with upper-constrained inputs
We propose a simple framework for analyzing feedforward queueing networks that have the following features: each customer belongs to a (customer) flow and the route that a custom...
S. Shioda
ATMOS
2010
150views Optimization» more  ATMOS 2010»
15 years 18 days ago
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
Frank Fischer, Christoph Helmberg