Sciweavers

9842 search results - page 352 / 1969
» Problem complexity
Sort
View
IPL
2008
86views more  IPL 2008»
15 years 6 months ago
A more efficient algorithm for perfect sorting by reversals
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
Sèverine Bérard, Cedric Chauve, Chri...
DLOG
2007
15 years 9 months ago
Planning in Action Formalisms based on DLs: First Results
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
Maja Milicic
APVIS
2006
15 years 8 months ago
Interactive optimization in cooperative environments
In the present paper, we introduce a multi-user interactive framework for solving complex optimization problems. The framework, called Co-UserHints, provides a visual computationa...
Joelma de Moura Ferreira, Hugo A. D. do Nascimento...
WSC
1997
15 years 8 months ago
Application of Simulation to Scheduling, Sequencing, and Material Handling
We describe the application of simulation analysis to a complex operational problem involving scheduling, sequencing, and material-handling decisions. The manufacturing process un...
Edward J. Williams, Ramu Narayanaswamy
COMPGEOM
2011
ACM
14 years 10 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...