13306 search results - page 456 / 2662 » Theoretical Computer Science |
214
click to vote
IBERAMIA
1998
Springer
15 years 11 months ago
1998
Springer
This paper 1 attempts to characterise a unifying overview of the practice of software engineers, AI designers, developers of evolutionary forms of computation, designers of adapti...
233
click to vote
SIGSOFT
2007
ACM
16 years 8 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
222
click to vote
WG
1995
Springer
15 years 11 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
198
click to vote
ITICSE
2004
ACM
16 years 1 months ago
2004
ACM
In this paper, we present an assignment for a course on Design patterns at the masters level, where students have to adapt an existing program to meet additional requirements. We ...
205
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...