Sciweavers

9842 search results - page 43 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
SIAMNUM
2011
139views more  SIAMNUM 2011»
13 years 2 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
STACS
2000
Springer
13 years 11 months ago
The Complexity of Poor Man's Logic
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
Edith Hemaspaandra
JCST
2010
189views more  JCST 2010»
13 years 2 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
JITECH
2010
116views more  JITECH 2010»
13 years 6 months ago
Design theory for dynamic complexity in information infrastructures: the case of building internet
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
Ole Hanseth, Kalle Lyytinen
AIPS
2008
13 years 10 months ago
Scheduling Meetings at Trade Events with Complex Preferences
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
Andreas Ernst, Gaurav Singh, René Weiskirch...