Sciweavers

77 search results - page 8 / 16
» Test Sets and Inequalities for Integer Programs
Sort
View
ATMOS
2007
119views Optimization» more  ATMOS 2007»
13 years 9 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
AICCSA
2006
IEEE
86views Hardware» more  AICCSA 2006»
14 years 1 months ago
On the Optimal Deployment of Heterogeneous Sensing Devices
The problem of optimally deploying a heterogeneous set of sensing devices in environments with differential surveillance requirements is presented. The problem is formulated in th...
Rabie Ramadan, Khaled Abdelghany, Hesham El-Rewini
ICML
2008
IEEE
14 years 8 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
14 years 8 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
JCO
1998
136views more  JCO 1998»
13 years 7 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...