Sciweavers

179 search results - page 20 / 36
» An LP-Based Heuristic for Optimal Planning
Sort
View
DATE
2005
IEEE
107views Hardware» more  DATE 2005»
14 years 2 months ago
Test Planning for Mixed-Signal SOCs with Wrapped Analog Cores
Many SOCs today contain both digital and analog embedded cores. Even though the test cost for such mixed-signal SOCs is significantly higher than that for digital SOCs, most prio...
Anuja Sehgal, Fang Liu, Sule Ozev, Krishnendu Chak...
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 7 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
EVOW
2004
Springer
14 years 2 months ago
Solving a Real-World Glass Cutting Problem
We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, ...
Jakob Puchinger, Günther R. Raidl, Gabriele K...
COR
2008
88views more  COR 2008»
13 years 8 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
TON
2012
11 years 11 months ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...