13376 search results - page 273 / 2676 » Problem Solving with |
128
Voted
CCCG
2008
15 years 5 months ago
2008
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
119
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper presents a novel broadband multimedia service called TV-Anytime. The basic idea of this service is to store broadcast media assets onto media server systems and allow c...
102
Voted
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
112
click to vote
CSCLP
2005
Springer
15 years 9 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
105
Voted
SAS
2005
Springer
15 years 9 months ago
2005
Springer
The termination insensitive secure information flow problem can be reduced to solving a safety problem via a simple program transformation. Barthe, D’Argenio, and Rezk coined th...