2412 search results - page 161 / 483 » Which Problems Have Strongly Exponential Complexity |
125
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
115
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
137
click to vote
IWMM
2009
Springer
15 years 10 months ago
2009
Springer
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
133
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
This paper describes an algorithm, called CQ-learning, which learns to adapt the state representation for multi-agent systems in order to coordinate with other agents. We propose ...
169
click to vote
JCSS
2011
14 years 10 months ago
2011
It is widely recognised that software development is a complex process. Among the factors that contribute to its inherent complexity is the gap between the design and the formal a...