556 search results - page 83 / 112 » A Comparative Study of Some Generalized Rough Approximations |
115
click to vote
GLOBECOM
2009
IEEE
15 years 5 months ago
2009
IEEE
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...
115
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
113
click to vote
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
112
click to vote
CN
2010
15 years 4 days ago
2010
Conventional simple p-cycle (Preconfigured Protection Cycle) concept allows fast and capacity-efficient span protection in WDM mesh networks. Unlike simple p-cycle, non-simple p-cy...
120
Voted
DAGSTUHL
2008
15 years 3 months ago
2008
Abstract. In this chapter, we present a new interactive procedure for multiobjective optimization, which is based on the use of a set of value functions as a preference model built...