450 search results - page 32 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
100
click to vote
AAAI
2012
13 years 2 months ago
2012
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speci...
110
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
CPM
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
IWPEC
2004
Springer
15 years 5 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
ENTCS
2002
14 years 11 months ago
2002
In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data struct...