• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 150
Next 10 →

List of Tables...........................

by Catherine Rose, Mills Olschanowsky, Catherine Rose, Mills Olschanowsky , 2011
"... by ..."
Abstract - Add to MetaCart
Abstract not found

Diagnosing the Weakest Link in WSN Testbeds: A Reliability and Cost Analysis

by Of The Usb Backchannel, Pablo E. Guerrero, Iliya Gurov, Ro Buchmann, Technische Universität Darmstadt, Kristof Van Laerhoven, Technische Universität Darmstadt
"... Abstract—This paper highlights and characterizes the main obstacle to deploying a robust wireless sensor network testbed: the USB connections that link each of the nodes via ethernet gateways to the central server. Unfortunately, these connections are also the components that, when properly installe ..."
Abstract - Add to MetaCart
Abstract—This paper highlights and characterizes the main obstacle to deploying a robust wireless sensor network testbed: the USB connections that link each of the nodes via ethernet gateways to the central server. Unfortunately, these connections are also the components that, when properly

Multi-loop Position Analysis via Iterated Linear Programming

by unknown authors
"... Abstract — This paper presents a numerical method able to isolate all configurations that an arbitrary loop linkage can adopt, within given ranges for its degrees of freedom. The procedure is general, in the sense that it can be applied to single or multiple intermingled loops of arbitrary topology. ..."
Abstract - Add to MetaCart
Abstract — This paper presents a numerical method able to isolate all configurations that an arbitrary loop linkage can adopt, within given ranges for its degrees of freedom. The procedure is general, in the sense that it can be applied to single or multiple intermingled loops of arbitrary topology

Akademisk avhandling för teknisk doktorsexamen vid

by Kungl Tekniska Högskolan, Kth Tryck , 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract - Add to MetaCart
mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where

SIMULATION, DEVELOPMENT AND DEPLOYMENT OF MOBILE WIRELESS SENSOR NETWORKS FOR MIGRATORY BIRD TRACKING

by Bird Tracking, William P. Bennett, William P., Development, Deployment Of, Mobile Wireless Sensor, William P. Bennett, William P. Bennett, Adviser Mehmet, C. Vuran , 2012
"... This thesis presents CraneTracker, a multi-modal sensing and communication system for monitoring migratory species at the continental level. By exploiting the robust and extensive cellular infrastructure across the continent, traditional mobile wireless sensor networks can be extended to enable reli ..."
Abstract - Add to MetaCart
reliable, low-cost monitoring of migratory species. The developed multi-tier architecture yields ecologists with unconventional behavior in-formation not furnished by alternative tracking systems at such a large scale and for a low-cost. The simulation, development and implementation of the Crane

Multi-loop Position Analysis via Iterated Linear Programming

by unknown authors
"... Abstract — This paper presents a numerical method able to isolate all configurations that an arbitrary loop linkage can adopt, within given ranges for its degrees of freedom. The procedure is general, in the sense that it can be applied to single or multiple intermingled loops of arbitrary topology, ..."
Abstract - Add to MetaCart
Abstract — This paper presents a numerical method able to isolate all configurations that an arbitrary loop linkage can adopt, within given ranges for its degrees of freedom. The procedure is general, in the sense that it can be applied to single or multiple intermingled loops of arbitrary topology

1 Smoothing and Decomposition for Analysis Sparse Recovery

by Zhao Tan, Student Member, Yonina C. Eldar, Amir Beck, Arye Nehorai
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

The Mapping Collector: Virtual Memory Support for Generational, Parallel, and Concurrent Compaction

by Michal Wegiel, Chandra Krintz , 2008
"... Parallel and concurrent garbage collectors are increasingly employed by managed runtime environments (MREs) to maintain scalability, as multi-core architectures and multi-threaded applications become pervasive. Moreover, state-of-the-art MREs commonly implement compaction to eliminate heap fragmenta ..."
Abstract - Cited by 15 (4 self) - Add to MetaCart
Parallel and concurrent garbage collectors are increasingly employed by managed runtime environments (MREs) to maintain scalability, as multi-core architectures and multi-threaded applications become pervasive. Moreover, state-of-the-art MREs commonly implement compaction to eliminate heap

Journal Logo Theory summary. Hard Probes 2012

by Carlos A. Salgado
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Parallelizing irregular C codes assisted by interprocedural shape analysis

by R. Asenjo, R. Castillo, F. Corbera, A. Navarro, A. Tineo, E. L. Zapata - In IPDPS , 2008
"... In the new multicore architecture arena, the problem of improving the performance of a code is more in the soft-ware side than in the hardware one. However, optimizing irregular dynamic data structure based codes for such ar-chitectures is not easy, either by hand or compiler assisted. Regarding thi ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
memory abstractions in a variety of recursive programs that create and manipulate dynamic data structures. We have also im-plemented a data dependence test over our interprocedural shape analysis. With this test we have obtained promis-ing results, automatically detecting parallelism in three C codes
Next 10 →
Results 11 - 20 of 150
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University