Sciweavers

601 search results - page 100 / 121
» Quantified Equality Constraints
Sort
View
INTEGRATION
2007
69views more  INTEGRATION 2007»
13 years 8 months ago
A fast algorithm for rectilinear block packing based on selected sequence-pair
In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain ...
Kunihiro Fujiyoshi, Chikaaki Kodama, Akira Ikeda
TSP
2008
120views more  TSP 2008»
13 years 8 months ago
Distributed Average Consensus With Dithered Quantization
In this paper, we develop algorithms for distributed computation of averages of the node data over networks with bandwidth/power constraints or large volumes of data. Distributed ...
Tuncer C. Aysal, Mark Coates, Michael Rabbat
JSS
2002
90views more  JSS 2002»
13 years 8 months ago
Producing reliable software: an experiment
A customer of high assurance software recently sponsored a software engineering experiment in which a small real-time software system was developed concurrently by two popular sof...
Carol Smidts, Xin Huang, James C. Widmaier
MP
2010
94views more  MP 2010»
13 years 7 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
PPDP
2010
Springer
13 years 7 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch