Sciweavers

CORR
2011
Springer
181views Education» more  CORR 2011»
13 years 4 months ago
Study of Throughput and Delay in Finite-Buffer Line Networks
—In this work, we study the effects of finite buffers on the throughput and delay of line networks with erasure links. We identify the calculation of performance parameters such...
Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
13 years 4 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
SIGMETRICS
2010
ACM
144views Hardware» more  SIGMETRICS 2010»
13 years 8 months ago
The sustainability hub: an information management tool for analysis and decision making
Sustainability is becoming an increasingly important driver for which decision makers – consumers, corporate and government – rely on principled, accurate and provenanced metr...
Steve Cayzer, Chris Preist
ICRA
2010
IEEE
162views Robotics» more  ICRA 2010»
13 years 8 months ago
Comparing and modeling distributed control strategies for miniature self-assembling robots
— We propose two contrasting approaches to the scalable distributed control of a swarm of self-assembling miniaturized robots, specifically the formation of chains of a desired ...
William C. Evans, Grégory Mermoud, Alcherio...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 9 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
SWARM
2008
SPRINGER
115views Optimization» more  SWARM 2008»
13 years 9 months ago
Path formation in a robot swarm
We present two swarm intelligence control mechanisms used for distributed robot path formation. In the first, the robots form linear chains. We study three variants of robot chains...
Shervin Nouyan, Alexandre Campo, Marco Dorigo
GIS
2006
ACM
13 years 9 months ago
Dynamic simplification and visualization of large maps
In this paper, we present an algorithm that performs simplification of large geographical maps through a novel use of graphics hardware. Given a map as a collection of non-interse...
Nabil H. Mustafa, Shankar Krishnan, Gokul Varadhan...
DM
2008
103views more  DM 2008»
13 years 9 months ago
A note on lattice chains and Delannoy numbers
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...
John S. Caughman IV, Clifford R. Haithcock, J. J. ...
BMCBI
2010
117views more  BMCBI 2010»
13 years 10 months ago
Beyond rotamers: a generative, probabilistic model of side chains in proteins
Background: Accurately covering the conformational space of amino acid side chains is essential for important applications such as protein design, docking and high resolution stru...
Tim Harder, Wouter Boomsma, Martin Paluszewski, Je...
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
14 years 2 months ago
On computational properties of chains of recurrences
Backward and mixed chains of recurrences are introduced. A complete set of chains of recurrences manipulation tools is described. Applications of these tools, related to the safet...
Eugene V. Zima