14158 search results - page 374 / 2832 » Generalized switch-setting problems |
107
click to vote
DAGSTUHL
2006
15 years 6 months ago
2006
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...
186
click to vote
MOR
2006
15 years 4 months ago
2006
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
134
click to vote
INFORMATICALT
2000
15 years 4 months ago
2000
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...
136
click to vote
JACM
2000
15 years 4 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
161
click to vote
ML
2000
ACM
15 years 4 months ago
2000
ACM
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...