Sciweavers

628 search results - page 35 / 126
» The minimum shift design problem
Sort
View
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...
COCOA
2008
Springer
13 years 9 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
ESA
2010
Springer
162views Algorithms» more  ESA 2010»
13 years 7 months ago
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S....
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
14 years 27 days ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
INFOCOM
2012
IEEE
11 years 9 months ago
ICP: Design and evaluation of an Interest control protocol for content-centric networking
—Content-centric networking (CCN) brings a paradigm shift in the present Internet communication model by addressing named-data instead of host locations. With respect to TCP/IP, ...
Giovanna Carofiglio, Massimo Gallo, Luca Muscariel...