Sciweavers

8825 search results - page 224 / 1765
» All for one or one for all
Sort
View
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
15 years 1 months ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers
COR
2006
75views more  COR 2006»
15 years 1 months ago
A new heuristic recursive algorithm for the strip rectangular packing problem
A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on heurist...
Defu Zhang, Yan Kang, Ansheng Deng
EOR
2006
82views more  EOR 2006»
15 years 1 months ago
Flowshop scheduling research after five decades
: All information systems have to be protected. As the number of information objects and the number of users increase the task of information system's protection becomes more ...
Jatinder N. D. Gupta, Edward F. Stafford
IPL
2008
78views more  IPL 2008»
15 years 1 months ago
Resource-bounded measure on probabilistic classes
We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...
Philippe Moser
59
Voted
IPL
2006
98views more  IPL 2006»
15 years 1 months ago
Transforming spanning trees and pseudo-triangulations
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...