Sciweavers

526 search results - page 2 / 106
» On the Number of Minimal Addition Chains
Sort
View
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
14 years 11 days ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
EOR
2010
104views more  EOR 2010»
13 years 3 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
ICRA
2010
IEEE
102views Robotics» more  ICRA 2010»
13 years 4 months ago
Immobilizing 2D serial chains in form closure grasps
: The immobilization of non-rigid objects is currently an active research area in robotics. This paper explores the problem by studying the immobilization of serial chains of rigid...
Elon Rimon, A. Frank van der Stappen
SIAMCOMP
2002
95views more  SIAMCOMP 2002»
13 years 5 months ago
Lower Bounds for Lucas Chains
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
Martin Kutz
IJSYSC
2010
65views more  IJSYSC 2010»
13 years 3 months ago
Partial state and input observability recovering by additional sensor implementation: a graph-theoretic approach
This paper deals with the problem of additional sensor location in order to recover the observability of any given part of the state and unknown input for structured linear system...
T. Boukhobza