Sciweavers

464 search results - page 46 / 93
» Improved Fixed-Parameter Algorithms for Two Feedback Set Pro...
Sort
View
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 7 months ago
Approximation Algorithms for Orienteering with Time Windows
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 ...
Chandra Chekuri, Nitish Korula
IJCAI
1997
13 years 8 months ago
Adaptive Goal Recognition
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 ...
Neal Lesh
ECCC
2010
143views more  ECCC 2010»
13 years 4 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
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 ...
Derrick Stolee, N. V. Vinodchandran
COMPGEOM
2010
ACM
14 years 14 days ago
Better bounds on the union complexity of locally fat objects
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...
Mark de Berg
RTSS
2000
IEEE
13 years 11 months ago
Performance Specifications and Metrics for Adaptive Real-Time Systems
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...
Chenyang Lu, John A. Stankovic, Tarek F. Abdelzahe...