Sciweavers

2738 search results - page 526 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
COCOON
2003
Springer
14 years 18 days ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...
IPSN
2003
Springer
14 years 17 days ago
A Distributed Algorithm for Waking-up in Heterogeneous Sensor Networks
In this paper we present a distributed, application-morphable, algorithm for waking up appropriate sensor nodes in a heterogeneous sensor network. We assume a sensor field consisti...
Akis Spyropoulos, Cauligi S. Raghavendra, Viktor K...
INFOCOM
2002
IEEE
14 years 9 days ago
Self-Verifying CSFQ
— Recently, a class of solutions including Core-Stateless Fair Queueing (CSFQ), Rainbow Fair Queueing, and Diffserv have been proposed to address the scalability concerns that ha...
Ion Stoica, Hui Zhang, Scott Shenker
MICRO
2002
IEEE
164views Hardware» more  MICRO 2002»
14 years 9 days ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
Amir Roth, Gurindar S. Sohi
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 7 days ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...