Sciweavers

1707 search results - page 73 / 342
» Early Integer Programming
Sort
View
ORL
2011
14 years 4 months ago
Solving large Steiner Triple Covering Problems
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
ICAT
2006
IEEE
15 years 3 months ago
Tangible Cubes as Programming Objects
In this paper, we describe early results in the development of an alternative programming method which uses large, three-dimensional acrylic blocks to construct programming sequen...
Andrew C. Smith
ICALP
1992
Springer
15 years 1 months ago
What Good Are Digital Clocks?
Real-time systems operate in \real," continuous time and state changes may occur at any real-numbered time point. Yet many veri cation methods are based on the assumption that...
Thomas A. Henzinger, Zohar Manna, Amir Pnueli
MP
2006
100views more  MP 2006»
14 years 9 months ago
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalit...
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, ...
ISCA
2006
IEEE
138views Hardware» more  ISCA 2006»
15 years 3 months ago
Program Demultiplexing: Data-flow based Speculative Parallelization of Methods in Sequential Programs
We present Program Demultiplexing (PD), an execution paradigm that creates concurrency in sequential programs by "demultiplexing" methods (functions or subroutines). Cal...
Saisanthosh Balakrishnan, Gurindar S. Sohi