1686 search results - page 128 / 338 » Programs as polygraphs: computability and complexity |
123
Voted
ENDM
2000
15 years 3 months ago
2000
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
128
Voted
COGSR
2011
14 years 10 months ago
2011
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...
99
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without maki...
148
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
132
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
Graph drawing software are now commonly used. However, the choice of a well-adapted program may be hard for an inexperienced user. This poster presents a website (http://www.polyte...