14158 search results - page 270 / 2832 » Generalized switch-setting problems |
131
click to vote
SIGKDD
2010
14 years 11 months ago
2010
The discovery and extraction of general lists on the Web continues to be an important problem facing the Web mining community. There have been numerous studies that claim to autom...
125
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
171
click to vote
FSTTCS
2003
Springer
15 years 9 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
139
click to vote
FPCA
1995
15 years 7 months ago
1995
This paper discusses the derivation of functional programs for grammar analysis problems, such as the Empty problem and the Reachable problem. Grammar analysis problems can be div...
146
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...