Sciweavers

9842 search results - page 185 / 1969
» Problem complexity
Sort
View
ENTCS
2002
207views more  ENTCS 2002»
15 years 2 months ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka
92
Voted
JITECH
2006
70views more  JITECH 2006»
15 years 2 months ago
Using coevolutionary and complexity theories to improve IS alignment: a multi-level approach
The misalignment of information systems (IS) components with the rest of an organization remains a critical and chronic unsolved problem in today's complex and turbulent worl...
Hind Benbya, Bill McKelvey
COR
2008
122views more  COR 2008»
15 years 2 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
128
Voted
ALIFE
2008
15 years 2 months ago
Criteria for Conceptual and Operational Notions of Complexity
While complex systems have been studied now for more than two decades, there still is no agreement on what complexity actually is. This lack of a definition might be a problem when...
Dominique Chu
TAMC
2009
Springer
15 years 7 months ago
On the Complexity of the Multiple Stack TSP, kSTSP
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Sophie Toulouse, Roberto Wolfler Calvo