Sciweavers

1161 search results - page 154 / 233
» Kinetic Dependence Graphs
Sort
View
ICSE
2009
IEEE-ACM
15 years 5 months ago
Codebook: Social networking over code
Social networking systems help people maintain connections to their friends, enabling awareness, communication, and collaboration, especially at a distance. In many studies of coo...
Andrew Begel, Robert DeLine
STACS
2009
Springer
15 years 5 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
15 years 5 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
IWPEC
2009
Springer
15 years 5 months ago
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
Peter Damaschke
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
15 years 5 months ago
Area-constrained coverage optimization by robotic sensor networks
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
Jorge Cortés