9842 search results - page 296 / 1969 » Problem complexity |
167
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
165
Voted
ESA
2004
Springer
16 years 5 days ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
157
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But COD...
268
click to vote
VLDB
2002
ACM
16 years 7 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
178
click to vote
ICECCS
1995
IEEE
15 years 10 months ago
1995
IEEE
When trying to describe the behaviour of large systems, such as the business processes of large enterprises, we often adopt diagramming techniques based on derivatives of data flo...