Sciweavers

835 search results - page 129 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
POPL
2007
ACM
14 years 8 months ago
Interprocedural analysis of asynchronous programs
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic ord...
Ranjit Jhala, Rupak Majumdar
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
14 years 8 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
13 years 11 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
DCOSS
2008
Springer
13 years 9 months ago
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
Ryo Sugihara, Rajesh K. Gupta
COMGEO
2008
ACM
13 years 7 months ago
Covering point sets with two disjoint disks or squares
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
Sergio Cabello, José Miguel Díaz-B&a...