Sciweavers

10072 search results - page 1368 / 2015
» Composition of Model Programs
Sort
View
CAV
2008
Springer
96views Hardware» more  CAV 2008»
15 years 9 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
WSC
2004
15 years 8 months ago
Data and Metadata Requirements for Composable Mission Space Environments
Composability is the capability to select and assemble reusable simulation components in various combinations into simulation systems to meet user requirements. The Defense Modeli...
Katherine L. Morse
DISOPT
2010
138views more  DISOPT 2010»
15 years 7 months ago
The Delivery Man Problem with time windows
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
Géraldine Heilporn, Jean-François Co...
DISOPT
2008
91views more  DISOPT 2008»
15 years 7 months ago
Partition inequalities for capacitated survivable network design based on directed p-cycles
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
Alper Atamtürk, Deepak Rajan
174
Voted
ENTCS
2008
64views more  ENTCS 2008»
15 years 7 months ago
General Refinement, Part Two: Flexible Refinement
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
Steve Reeves, David Streader
« Prev « First page 1368 / 2015 Last » Next »