3229 search results - page 353 / 646 » The Theory of Timed Automata |
160
click to vote
SEC
2000
15 years 8 months ago
2000
The theory of computer viruses has been studied by several authors, though there is no systematic theoretical study up to now. The long time open question in this area is as follo...
179
click to vote
IJCAI
1993
15 years 8 months ago
1993
One method for reducing the time required for plan generation is to learn search control rules from experience. Most of the recent work in learning search control knowledge has co...
162
Voted
NIPS
1996
15 years 8 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
166
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
165
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we study imprecise terrains, that is, triangulated terrains with a vertical error interval in the vertices. We study the problem of removing as many local extrema (...