Sciweavers

278 search results - page 35 / 56
» Two Upper Bounds on the Chromatic Number
Sort
View
IPPS
1998
IEEE
14 years 22 days ago
Fault Tolerant Mobility Planning for Rapidly Deployable Wireless Networks
Rapidly deployable wireless networks consist of mobile base stations and less powerful mobile hosts. The mobile base stations have to maintain wireless connectivity while on the mo...
Charles Shields Jr., Vikas Jain, Simeon C. Ntafos,...
STACS
1999
Springer
14 years 22 days ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
SIROCCO
2001
13 years 9 months ago
Efficient Condition-Based Consensus
The condition-based approach for consensus solvability (that we have introduced in a previous paper, ACM STOC'01) consists in identifying sets of input vectors for which it i...
Achour Mostéfaoui, Sergio Rajsbaum, Michel ...
MP
2008
99views more  MP 2008»
13 years 8 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 3 months ago
Streaming Tree Transducers
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...
Rajeev Alur, Loris D'Antoni