1686 search results - page 164 / 338 » Programs as polygraphs: computability and complexity |
153
Voted
EUROPAR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Grids are very complex and volatile infrastructures that exhibit parallel and distributed characteristics. To harness their complexity as well as the increasing intricacy...
137
click to vote
SCAI
2001
15 years 5 months ago
2001
We apply evolutionary algorithm (EA) to the design of controller for adaptive robots. EAs can be successful for more complicated tasks, where traditional engineering methods strugg...
164
click to vote
CIE
2007
Springer
15 years 7 months ago
2007
Springer
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
162
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
135
click to vote
ESOP
2009
Springer
15 years 7 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...