7380 search results - page 101 / 1476 » time 2008 |
151
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
: For an infinite-horizon optimal control problem, the cost does not, in general, converge. The classical work-around to this problem is to introduce a discount or "forgetting...
137
click to vote
EOR
2008
15 years 6 months ago
2008
Relationships between an assembler and a vendor in a supply chain are investigated in two-period models when the assembler wants to reduce response time by incentive systems. The ...
150
click to vote
CPC
2006
15 years 6 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
168
click to vote
CPC
2006
15 years 6 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
150
click to vote
IJNSEC
2008
15 years 6 months ago
2008
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...