3946 search results - page 321 / 790 » The computational complexity of choice sets |
178
click to vote
HPDC
1995
IEEE
15 years 10 months ago
1995
IEEE
A novel packet multiplexing technique, called Rotating-Priority-Queues (RPQ), is presented which exploits the tradeoff between high eficiency, i.e., the ability to support many co...
200
click to vote
DAIS
2010
15 years 8 months ago
2010
The growing needs in computational power to answer to the increasing number of on-line services and the complexity of applications makes it mandatory to build corresponding hardwar...
173
click to vote
WSCG
2004
15 years 8 months ago
2004
There are some different methods used for depth perception. In this paper, a new method for the depth perception, by using a single camera based on an interpolation, is introduced...
196
click to vote
NETWORKS
2011
15 years 1 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
151
click to vote
MFCS
1995
Springer
15 years 10 months ago
1995
Springer
In AS , we de ned a notion of measure on the complexity class P in the spirit of the work of Lutz L92 that provides a notion of measure on complexity classes at least as large as...