Sciweavers

28888 search results - page 422 / 5778
» Computability and complexity in analysis
Sort
View
192
Voted
ICGI
2010
Springer
15 years 5 months ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
CSCWD
2001
Springer
15 years 11 months ago
What Complex Systems Research Can Teach Us About Collaborative Design
Collaborative design is challenging because strong interdependencies between design issues make it difficult to converge on a single design that satisfies these dependencies and i...
Mark Klein, Hiroki Sayama, Peyman Faratin, Yaneer ...
179
Voted
FSTTCS
1994
Springer
15 years 11 months ago
My Favorite Ten Complexity Theorems of the Past Decade
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discus...
Lance Fortnow
DLT
2009
15 years 4 months ago
Asymptotic Cellular Complexity
We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal...
Bruno Durand, Victor Poupet
191
Voted
AAAI
1990
15 years 8 months ago
Approximation Reformulations
Although computers are widely used to simulate complex physical systems, crafting the underlying models that enable computer analysis remains difficult. When a model is created fo...
Daniel S. Weld