2086 search results - page 262 / 418 » Mathematical Theory Exploration |
SIAMJO
2011
13 years 5 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
JCST
2010
13 years 5 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
SIAMREV
2010
13 years 5 months ago
2010
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
TSMC
2010
13 years 4 months ago
2010
There exists a widely recognized need to better understand and manage complex "systems of systems," ranging from biology, ecology, and medicine to network-centric technol...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...