464 search results - page 46 / 93 » Improved Fixed-Parameter Algorithms for Two Feedback Set Pro... |
138
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
110
Voted
IJCAI
1997
15 years 4 months ago
1997
Because observing the same actions can warrant different conclusions depending on who executed the actions, a goal recognizer that works well on one person might not work well on ...
140
Voted
ECCC
2010
15 years 4 days ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
104
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
171
click to vote
RTSS
2000
IEEE
15 years 7 months ago
2000
IEEE
While early research on real-time computing was concerned with guaranteeing avoidance of undesirable effects such as overload and deadline misses, adaptive real-time systems are d...