3082 search results - page 133 / 617 » New Bounds for the Controller Problem |
133
click to vote
EUROCRYPT
2006
Springer
15 years 8 months ago
2006
Springer
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
137
click to vote
COR
2010
15 years 4 months ago
2010
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
132
click to vote
EUROPAR
2001
Springer
15 years 8 months ago
2001
Springer
This paper is on the construction of a server subsystem in a client/server system in an application context where the number of potential clients can be arbitrarily large. The imp...
154
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
141
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees ar...