2976 search results - page 210 / 596 » On the bounded integer programming |
142
click to vote
ECCC
2010
15 years 6 months ago
2010
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
186
click to vote
EOR
2008
15 years 6 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
181
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...
223
click to vote
COCO
2011
Springer
14 years 6 months ago
2011
Springer
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
155
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...